选择排序分两轮循环,第一轮循环遍历整个待排序序列,第二轮将这轮中最小的放在最前面,时间复杂度O(n^2)
#include <iostream>
#include <stdio.h>
using namespace std;
int printarry(int* arry,int len){
for(int i=0 ; i<len ; i++ ){
printf("%d ",arry[i]);
}
printf("\n");
return 1;
}
int selectsort(int *unsorted , int len){
for(int i = 0 ; i < len ;i++){
for (int j = i ; j < len ; j++){
if(unsorted[i]>unsorted[j]){
int t = unsorted[j];
unsorted[j] = unsorted[i];
unsorted[i] = t;
}
}
}
return 1;
}
int main()
{
cout << "Hello world!" << endl;
int sortarry[] = {5,2,72,1,777,22222,22};
int len = sizeof(sortarry)/sizeof(int);
printf("unsorted arry len is %d ,value is: ",len);
printarry(sortarry,len);
selectsort(sortarry,len);
printf("sorted arry len is %d ,value is: " ,len);
printarry(sortarry,len);
return 0;
}