选择排序

 1 #include <iostream>
 2 //交换函数
 3 void qswap(int& p, int& q)
 4 {
 5     int temp = p;
 6     p = q;
 7     q = temp;
 8 }
 9 
10 //选择排序
11 void Sort(int array[], int n)
12 {
13     for (int i = 0; i <n-1; ++i)
14     {
15         int min = i;
16         for (int j = i+1; j < n; ++j)
17         {
18             if (array[min] > array[j])
19             {
20                 min = j;
21             }
22         }
23         if(min!= i)
24         qswap(array[min], array[i]);
25     }
26 }
27 
28 int main()
29 {
30     int ch[] = { 2,4,6,8,3,5,7,9,0,1 };
31     bubbleSort(ch, 10);
32     int length = sizeof(ch) / sizeof(int);
33     for (int i = 0; i < length; ++i)
34     {
35         std::cout << ch[i] << " ";
36     }
37     return 0;
38 }