选择排序

?

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54

#include <iostream>   using namespace std;   void seSort(int arr[], int n) {     int min, temp;     for(int i = 0; i < n - 1; i++)     {         min = i;         for(int j = i + 1; j < n; j++)         {             if(arr[j] < arr[min])             {                 min = j;             }         }           if (min != i)         {             temp = arr[min];             arr[min] = arr[i];             arr[i] = temp;           }       } }   int main() {     int arr[10] = {10, 9 ,5, 6, 8, 7, 3, 4,2, 1};     int len = sizeof(arr)/sizeof(arr[0]);     // before sort     for(int i = 0; i< 10; i++)     {         cout<<arr[i]<<"--";     }       cout<<endl;       seSort(arr, len);       // after sort     for(int i = 0; i< 10; i++)     {         cout<<arr[i]<<"--";     }       cout<<endl;       return 0;   }