C语言快速排序

#include <stdio.h>
#include <time.h>
void quickSort(int *p,int low,int high)
{
    if(low < high)
    {
        int tem = p[low];
        int l = low;
        int h = high;
        while(l < h)
        {
            while(p[h] >= tem && l < h)
                h--;
            p[l] = p[h];
            while(p[l] <= tem && l < h)
                l++;
            p[h] = p[l];
        }
        p[l] = tem;
        quickSort(p,low,l-1);
        quickSort(p,h+1,high);
    }
}

int main()
{
    int arr[10] = {0};
    srand(time(NULL));
    for(int i = 0;i < 10;i++)
    {
        arr[i] = rand()%10;
        for(int j = 0;j < i;j++)
        {
            if(arr[j] == arr[i])
                i--;
        }
    }
    quickSort(arr,0,9);
    for(int i = 0;i < 10;i++)
    {
        printf("arr[%d] = %d\n",i,arr[i]);
    }
    return 0;
}