快速排序1

[c]代码库

#include <stdlib.h>
#include <stdio.h>
 
void select_sort(int a[], int n) {
	int i;
	int k;
	int t;
    for( i=0; i < n-1; i++) {
        int j = i;
        int key = a[j];
        //实现所找的数与key进行比较交换，改变key，否则i+1，key前移
        for( k=i; k < n-1; k++) {
            if (a[k] < key) {
                j = k;
                key = a[k];
            }
        }0
         t = a[i];
        a[i] = a[j];
        a[j] = t;
    }
}
 
void main() {
	int i;
    int a[10] = {12,9,3,7,5,14,6,0,11,8};
    select_sort(a, 10);
    for( i=0; i < 10; i++) {
        printf("%d ", a[i]);
    }
    printf("\n");
    return 0;
}