直接选择排序
1 #include <iostream.h> 2 3 int* selectionSort(int datas[], int size) 4 { 5 int* temp = new int[size]; 6 int f,k; 7 for(int i=0;i<size;i++) 8 { 9 f=i; 10 for(int j=i+1;j<size;j++) 11 { 12 if(datas[j]<datas[f]) 13 f=j; 14 } 15 k = datas[i]; 16 datas[i] = datas[f]; 17 datas[f] = k; 18 } 19 for(int l=0;l<size;l++) 20 temp[l] = datas[l]; 21 return temp; 22 } 23 24 int main(int argc, char* argv[]) 25 { 26 int data[] = {23,25,21,4,34,64,63,88}; 27 int size = sizeof(data)/sizeof(data[0]); 28 int* result = selectionSort(data,size); 29 for(int i=0;i<size;i++) 30 cout << result[i] << " "; 31 cout << endl; 32 return 0; 33 }