快速排序实现

#include<stdio.h>
int a[] = {23,46,0,8,11,18};
void qsort(int left,int right){
    if(left>=right){
        return;
    }
    int i = left;
    int j = right;
    int key = a[i];
    while(i<j){
        while(i<j&&a[j]>key){
            j--;
        }
        a[i] = a[j];
        while(i<j&&a[i]<key){
            i++;
        }
        a[j] = a[i];
    }
    a[i] = key;
    qsort(left,i-1);
    qsort(i+1,right);
}
int main(){
    qsort(0,5);
    int i=0;
    for(;i<6;i++){
        printf("%d
",a[i]);
    }
    return 0;
}