思路:選擇排序僅僅優化了冒泡排序的交換次數;
依次比較,將較大/較小的數放在數列前/後;
代碼如下:
#include <stdio.h>
#include <stdlib.h>
void swapData(int* a, int* b)
{
int temp = *a;
*a = *b;
*b = temp;
}
void selectSort(int* arr,int length)
{
int i, j;
for ( i = 0; i < length; ++i)
{
int min = i;
for ( j = i+1 ; j < length; ++j)
{
if (arr[j] > arr[min])
min = j;
}
if (i != min)
swapData(&arr[i], &arr[min]);
}
}
int main()
{
int arr[8] = { 1, 3, 4, 5, 7, 8, 6, 5 };
for (int i = 0; i < 8; ++i)
printf("%d ", arr[i]);
printf("\n");
printf("---------排序後-------\n");
selectSort(arr, 8);
for (int i = 0; i < 8; ++i)
printf("%d ", arr[i]);
printf("\n");
system("pause");
return 0;
}