简单选择排序法(Simple Selection Sort)就是通过n-i次关键字比较,从n-i+1个记录中选出关键字最小的记录,并和第i(1<=i<=n)个记录交换之。
#include<iostream>
using namespace std;
#define MaxSize 10
#define TRUE 1
#define FALSE 0
typedef struct
{
int r[MaxSize];
int length;
}SqList;
void swap(SqList* L, int i, int j)
{
int temp = L->r[i];
L->r[i] = L->r[j];
L->r[j] = temp;
}
//对顺序表L作简单选择排序,每次循环比较选出关键字最小的记录
void SelectSort(SqList* L)
{
int i, j, min;
for (i = 1; i < L->length; i++)
{
min = i;
for (j = i + 1; j <= L->length; j++)
{
if (L->r[min] > L->r[j])
min = j;
}
if(min!=i)
swap(L, i, min);
}
}
int main()
{
SqList L;
int r[MaxSize] = { 9,8,7,6,5,4,3,2,1 };
L.length = 9;
for (int i = 0; i < L.length; i++)
L.r[i + 1] = r[i];
SelectSort(&L);
for (int i = 1; i <= L.length; i++)
{
cout << L.r[i] << endl;
}
return 0;
}