快速排序

#include <stdio.h>void quicksort(int a[], int len) {int x,i,j;if (len <= 1){return;}i = 0;j = len - 1;x = a[i];while (i != j){while (i != j){if (a[j] <= x){a[i] = a[j];//ken = j;i++;break;}j--;}while (i != j){if (a[i] > x){a[j] = a[i];j--;break;}i++;}}a[j] = x;quicksort(a,j);quicksort(&a[j+ 1],len - j - 1);}void main(){int i=0;int a[10] = {9,8,7,6,2,5,4,3,1,0};quicksort(a, 10);for (i = 0;i<10;i++){printf("%d\t",a[i]);}}