选择排序

#include <iostream>

using namespace std;

void print(int data[],int len);

void select_sort(int data[],int len)
{
    int i,j,iTemp;
    for(i = 0;i < len;i++){
        for(j = i;j < len;j++){
            if(data[j] < data[i]){//与第i个数进行比较，将小想数置换到i的位置上；每次循环都是将最小的数放到i位置上
                iTemp = data[i];data[i] = data[j];data[j] = iTemp;
            }
        }
    }
}


void print(int data[],int len)
{
    for(int i = 0;i < len;i++){
        cout << data[i] << " ";
    }
    cout << endl;
}


int main()
{
    int data[] = {4,2,3,7,6,1,5,9,10,8};
    print(data,10);
    cout << "###################" << endl;
    select_sort(data,sizeof(data)/sizeof(int));
    cout << "###################" << endl;
    print(data,sizeof(data)/sizeof(int));
    cout << "###################" << endl;
    return 0;
}