kuaisupaixu

#include<stdio.h> void quiksort(int a[],int low,int high) {  int i = low;     int j = high;      int temp = a[i];     if( low < high)     {                  while(i < j)         {             while((a[j] >= temp) && (i < j))             {                 j--;             }             a[i] = a[j];    a[j]=temp;             while((a[i] <= temp) && (i < j))             {                 i++;             }              a[j]= a[i];    a[i]=temp;         }         quiksort(a,low,i-1);         quiksort(a,j+1,high);     }     else     {         return ;     } } void main() {     int arry[5] = {23,1,21,4,19};     quiksort(arry,0,4);     for(int i=0;i<5;i++)     {   printf("%d ",arry[i]);     }     printf(" "); }

原文地址:https://www.cnblogs.com/452035305qq/p/6112641.html