c实现数据结构中快速排序

#include <stdio.h>
void print(int k[],int n);
//快速排序
void quickSort(int arry[], int left, int right);
int main(){
    int K[]= {49,38,97,76,65,13,27,50};
    quickSort(K,0,7);
    print(K,8);
}
void quickSort(int arry[], int left, int right) {
    int begin =  left;
    int end = right;
    if(left > right) {
        return;
    }
    while(left != right) {
        while(right > left && arry[right] >= arry[begin]) {
            right --;
        }
        while(left < right && arry[left] <= arry[begin]) {
            left ++;
        }
        int tmp = arry[right];
        arry[right] = arry[left];
        arry[left] = tmp;
    }
    int tmpBase = arry[begin];
    arry[begin] = arry[left];
    arry[left] = tmpBase;
    quickSort(arry, begin, left - 1);
    quickSort(arry, left + 1, end);
}
void print(int k[],int n){
    for (int i=0;i<n;i++){
        printf("%d\n",k[i]);
    }
}