每一趟在n-i+1(i=1,2,…,n-1)个记录中选取最小的记录作为有序序列的第i个记录。
时间复杂度O(n2)
#include <iostream>
#include <cstdlib>
//顺序表结构
#define MAXSIZE 10 //要排序数组个数最大值
typedef struct
{
int r[MAXSIZE + 1]; //存储要排序数组,r[0]作为哨兵或临时变量
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;
}
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 (i != min)
swap(L, i, min);
}
}
void main()
{
SqList data;
int len = 10; //待排序列个数
srand((int)time_t(NULL));
data.r[0] = { 0 };
std::cout << "排序前的数列为:";
for (int i = 1; i <= len; ++i)
{
data.r[i] = rand() % 10 + 1;
std::cout << data.r[i] << ' ';
}
data.length = len;
SelectSort(&data);
printf("\n");
std::cout << "排序后的数列为:";
for (int i = 1; i <= len; ++i)
{
std::cout << data.r[i] << ' ';
}
}