C语言实现快速排序

总算自己写了一遍！！

#include<stdio.h>
#include<stdlib.h>
void Qsort(int p[],int low,int high);
int Partition(int p[],int low,int high);
void Swap(int *a,int *b);
int main(void){
    int n;
    int *p; //动态数组的声明详见p220
    puts("输入你要输入数字的个数：");
    scanf("%d",&n);
    p = (int*)malloc(n*sizeof(int));
    for(int i=0;i<n;i++)
    {
            scanf("%d",&p[i]);
            }
    Qsort(p,0,n-1);
    for(int i=0;i<n;i++)
    {
            printf("%d\t",p[i]);
            }
    free(p);
    system("PAUSE");
    return 0;
    }

void Qsort(int p[],int low,int high)
   {
     if(low < high)
     {
            int pivotLoc = Partition(p,low,high);
            Qsort(p,low,pivotLoc-1);
            Qsort(p,pivotLoc+1,high);
     }
    }
int Partition(int p[],int low,int high)
{
    while(low<high)
    {
        while(low<high && p[high]>=p[low])
        {
              high--;
        }
        Swap(&p[low],&p[high]);
        while(low<high && p[low]<=p[high])
        {
               low++;
        }
        Swap(&p[low],&p[high]);
     }
        return low;
}
void Swap(int *a,int *b){
         int temp;
         temp = *a;
         *a = *b;
         *b = temp;
         }