算法学习与实践之选择排序

#include <stdio.h>#include <stdlib.h>#include <time.h>int n;int *a;void SelectSort(int A[], int N){int i,j,min;int tmp;for(i = 0; i < N; i++) {min = i;for(j = i; j < N; j++) {if(A[min] > A[j])min = j;}tmp = A[i];A[i] = A[min];A[min] = tmp;}}int main(void){int i;n = 1000;a = (int *)malloc(n * sizeof(int));srand((unsigned)time(NULL));for(i = 0; i < n; i++)a[i]= rand() % 1000000;SelectSort(a, n);for(i = 0; i < n; i++)printf("%6d \n", a[i]);printf("\n\r");return 0;}