//取数组中的最小值
int SelectMinValue(int a[], int n, int k)
{
int nMin = 100;
int r = 0;
for (int i = k; i < n; i++)
{
if (a[i] < nMin)
{
nMin = a[i];
r= i;
}
}
return r;
}
//选择排序算法
void SelectSort(int a[],int n)
{
for (int i = 0; i < n; ++i)
{
int r = SelectMinValue(a,n,i);
int x = a[i];
a[i] = a[r];
a[r] = x;
print(a,n,i);
}
}
int _tmain(int argc, _TCHAR* argv[])
{
int a[8] = {32,13,54,73,28,46,91,65};
print(a,8,0); //打印出初始值
//InsertSort(a,8); //直接插入排序算法
//ShellSort(a,8); //希尔插入排序算法
SelectSort(a,8);
return 0;
}
int SelectMinValue(int a[], int n, int k)
{
int nMin = 100;
int r = 0;
for (int i = k; i < n; i++)
{
if (a[i] < nMin)
{
nMin = a[i];
r= i;
}
}
return r;
}
//选择排序算法
void SelectSort(int a[],int n)
{
for (int i = 0; i < n; ++i)
{
int r = SelectMinValue(a,n,i);
int x = a[i];
a[i] = a[r];
a[r] = x;
print(a,n,i);
}
}
int _tmain(int argc, _TCHAR* argv[])
{
int a[8] = {32,13,54,73,28,46,91,65};
print(a,8,0); //打印出初始值
//InsertSort(a,8); //直接插入排序算法
//ShellSort(a,8); //希尔插入排序算法
SelectSort(a,8);
return 0;
}