title: Equivalent java code statement for C code statement used in recursion
body: <p>The code below does quick sort in C.I tried to translate the same code logic into java.But, i am unable to write the equivalent Java code statement for  "partition(&amp;arr[left+1],size-left-1);" in the partition function below.Can anyone help? </p>
  
  <pre><code>   #include&lt;stdio.h&gt;
      int main()
      {
          int arr[8]={4,8,1,6,3,7,2,5};
          partition(arr,8);//Initial Calling of partition function
          int i;
          for(i=0;i&lt;8;i++)
          printf("%d  ",arr[i]);
          return 0;
      }
       void partition(int arr[],int size)
      {
             if(size&lt;2)
             return;
             int pivot=arr[rand()%size];
             int left=0,right=size-1,temp=0;
             while(left&lt;right)
             {
                 while(arr[left]&lt;pivot)
                 left++;
                 while(arr[right]&gt;pivot)
                 right--;
                 temp=arr[left],arr[left]=arr[right],arr[right]=temp;//swapping values
  
             }
          //partitioning and recursive calling
             partition(arr,left);
              partition(&amp;arr[left+1],size-left-1);//The problem is to write an equivalent code for this
                                                  //line in Java
  
      }
  </code></pre>