selectsort.cpp

冒泡排序

 
#include <stdio.h>
#include <iostream.h>

#define MAX 255
int R[MAX];

void Select_Sort(int n)
{
   int i,j,k;
   for(i=1;i<n;i++)
   { 
     k=i;
     for(j=i+1;j<=n;j++) /* 在当前无序区R[i..n]中选key最小的记录R[k] */
       if(R[j]<R[k])
         k=j; /* k记下目前找到的最小关键字所在的位置 */
       if(k!=i)
       { /* 交换R[i]和R[k] */
         R[0]=R[i]; R[i]=R[k]; R[k]=R[0]; /* R[0]作暂存单元 */
       } /* endif */
     } /* endfor */
} /* end of Select_Sort */

void main()
{
	int i,n;
	cout << "Please input total element number of the sequence:" ;
	cin >> n;
	if(n<=0||n>MAX)
	{
		cout << "n must more than 0 and less than" << MAX;
	}
	cout << "Please input the elements one by one:" << endl;
	for(i=1;i<=n;i++)
		cin >> R[i];
	cout << "The sequence you input is:" ;
	for(i=1;i<=n;i++)
		cout << "   " << R[i] ;
	Select_Sort(n);//选择排序
	cout << endl << endl;
	cout << "The sequence after select_sort is:" ;
	for(i=1;i<=n;i++)
		cout << "   " << R[i];
	cout << endl << endl;
	
}