选择排序

#include "stdafx.h"
#include<iostream>  //导入输入输出流库
using namespace std;




void print(int a[], int n, int i){
cout << "第" << i + 1 << "趟 : ";
for (int j = 0; j < n; j++){
cout << a[j] << "   ";
}
cout << endl;
}


//得到数组比当前值-数小的索引
//@return int 数组的键值
int SelectMinKey(int a[], int n, int i)
{
int k = i;
for (int j = i + 1; j< n; ++j) {
if (a[k] > a[j]) k = j;
}
return k;
}


int _tmain(int argc, _TCHAR* argv[])
{
int a[8] = { 3, 1, 5, 7, 2, 4, 9, 6 };
cout << "初始值：";
for (int j = 0; j<8; j++){
cout << a[j] << "  ";
}
cout << endl << endl;
selectSort(a, 8);
print(a, 8, 8);




return 0;
}