例22：快速排序

#include<stdio.h>
#include<stdlib.h>

void MyQuickSort(int *pArray,int Start,int End)
{
                int key = pArray[Start];
                int low = Start,high = End;
                while(low < high)
                {
                        while(low < high && key < pArray[high])
                        {
                                    high--;
                        }
                        pArray[low] = pArray[high];
                        while(low < high && key > pArray[low])
                        {
                                  low++;
                        }
                        pArray[high] = pArray[low];
                }
                pArray[low] = key;
                if(Start < low)
                MyQuickSort(pArray,Start,low);
                if(End > low+1)
                MyQuickSort(pArray,low+1,End);
}

int main()
{
    int pArray[20],nCount;
    while(~scanf("%d",&nCount) && nCount)
    {
                               for(int i = 0; i<nCount && i<20;i++)
                               {
                                       scanf("%d",&pArray[i]);
                               }
                               MyQuickSort(pArray,0,nCount-1);
                               for(int i = 0;i<nCount && i<20;i++)
                               {
                                       printf("%d ",pArray[i]);
                               }
    }
    
    return 0;
}

#include<stdio.h>
#include<stdlib.h>

void MyQuickSort(int *pArray,int Start,int End)
{
                int key = pArray[Start];
                int low = Start,high = End;
                while(low < high)
                {
                        while(low < high && key < pArray[high])
                        {
                                    high--;
                        }
                        pArray[low] = pArray[high];
                        while(low < high && key > pArray[low])
                        {
                                  low++;
                        }
                        pArray[high] = pArray[low];
                }
                pArray[low] = key;
                if(Start < low)
                MyQuickSort(pArray,Start,low);
                if(End > low+1)
                MyQuickSort(pArray,low+1,End);
}

int main()
{
    int pArray[20],nCount;
    while(~scanf("%d",&nCount) && nCount)
    {
                               for(int i = 0; i<nCount && i<20;i++)
                               {
                                       scanf("%d",&pArray[i]);
                               }
                               MyQuickSort(pArray,0,nCount-1);
                               for(int i = 0;i<nCount && i<20;i++)
                               {
                                       printf("%d ",pArray[i]);
                               }
    }
    
    return 0;
}