快速排序 时间复杂度最小的算法

int main()
{
    int n,i,j;
    int array[20];
    
    printf("请输入：");
    scanf("%d",&n);
    

    // 快速排序
        for(int i=0;i<n;i++)
    {
        scanf("%d",&array[i]);
    } 
    int low =array[0];
    int high= array[n];
    
    QuickSort(array,low,high); 

}

void QuickSort(int A[],int low,int high)
{
    if (low < high)
    {
        int pivot=part(A,low,high);
        QuickSort(A,low,pivot-1);
        QuickSort(A,pivot+1,high);
    }
    
}

 int part(int A[],int low,int high)
 {
     int pivot =A[low];
     while(low<high)
     {
         while(low<high&&A[high]>=pivot)
         {
             --high;
         }
         A[low]=A[high];
         while(low<high&&A[low]<=pivot)
         {
             ++low;
         }
         A[high]=A[low];
     }
      A[low]=pivot;
      return low;
 }