选择排序

#include <stdio.h>#include <stdlib.h>#define N10void ChooseSort(int *a, int num);int main(){int a[10] = {11, 2, 4, 3, 12, 8, 9, 5, 7, 10};for (int i = 0; i < N; i ++){printf("%-4d", a[i]);}printf("\n");ChooseSort(a, N);for (int i = 0; i < N; i ++){printf("%-4d", a[i]);}system("pause");return 0;}void ChooseSort(int *a, int num){int i = 0, choose = 0;int temp;for (i = 0; i < num; i ++){choose = i;for (int j = i+1; j < num; j ++){if (a[choose] > a[j]){temp = a[j];a[j] = a[choose];a[choose] =temp;}}}}

基本思想：

1.把整个数组分为两个部分，即有序和无序。

2.从无序中选择最小值，与无序的第一个数交换