编辑代码

#include <stdio.h>
void quick_sort(int a[], int low, int high);

int main () {
  int a[10];
  const int SIZE=10;
  for(int i=0;i<SIZE;i++){
  scanf("%d",&a[i]);
  }
  quick_sort(a, 0, SIZE-1);
  for(int i=0;i<SIZE;i++){
      printf("%d ",a[i]);
  }
}

void quick_sort(int a[], int low, int high)
{
    int i,j,temp;
    int pivot;

    i=low;
    j=high;
    pivot=a[low];

    if(i>j){
        return;
    }

    while(i!=j){

        while(a[j]>=pivot && i<j){
            j--;
        }

        while(a[i]<=pivot && i<j){
            i++;
        }

        if(i<j){
            temp=a[i];
            a[i]=a[j];
            a[j]=temp;
        }
    }
    a[low]=a[i];
    a[i]=pivot;

    quick_sort(a, low, i-1);
    quick_sort(a, i+1, high);
}