title: What is the time complexity of the following program?
body: <pre><code>#include &lt;stdio.h&gt;
  
  void partition(int a[],int p,int r)
  {
  
      int q;
      if(p&lt;r)
      {
          q=quicksort(a,p,r);
          partition(a,p,q-1);
          partition(a,q+1,r);
      }
  }
  
  int quicksort(int a[],int p,int r)
  
  {
  
      int pivot=p;
      int f=p,temp;
      int l=r;
  
      while(f&lt;l)
      {
          while(a[f]&lt;=a[pivot])
          f++;
          while(a[l]&gt;a[pivot])
          l--;
          if(f&lt;l)
          {
              temp=a[f];
              a[f]=a[l];
              a[l]=temp;
          }
      }
      temp=a[pivot];
      a[pivot]=a[l];
      a[l]=temp;
      return l;
  }
  
  int main(void)
  
  {
  
      // your code goes here
      int n;
      scanf("%d",&amp;n);
      int a[n];
      int i;
      for(i=0;i&lt;n;i++)
      {
          scanf("%d",&amp;a[i]);
      }
      partition(a,0,n-1);
      for(i=0;i&lt;n;i++)
      {
          printf("%d ",a[i]);
      }
      return 0;
  }
  </code></pre>
  
  <p>This is an algorithm for quicksort my question is whether it takes more time complexity than O(nlogn).</p>