快速排序(基于C语言)

#include<stdio.h>
#include<stdlib.h>
int a[100];
void quicksort(int left,int right){
	int i,j,temp;
	if(left>right)
		return;
	temp = a[left];//temp存储基准数 
	i = left,j = right;
	while(i!=j){
		//顺序很重要  从右往左找 
		while(a[j]>=temp && i<j)
			j--;
		while(a[i]<=temp && i<j)
			i++;
		if(i<j){
			int t = a[i];
			a[i] = a[j];
			a[j] = t;
		}
	}
	a[left] = a[i];
	a[i] = temp;
	quicksort(left,i-1);
	quicksort(i+1,right);
}
int main(){
	int n,t;
	scanf("%d",&n);
	for(int i = 0;i<n;i++){
		scanf("%d",&a[i]);
	}
	quicksort(0,n-1); 
	for(int i =0;i<10;i++)
		printf("%d  ",a[i]);
	printf("\n");
	getchar();
}