For this Question: Given an array <b>A[]</b> having <b>N</b> positive integers. You need to arrange these elements in increasing order using <b>Quick Sort</b> algorithm.<b>User Task:</b>
Since this is a functional problem you don't have to worry about the input. You just have to complete the function <b>quickSort()</b> which contains following arguments.

<b>A[]:</b> input array
<b>start:</b> starting index of array
<b>end</b>: ending index of array

Constraints
1 <= T <= 1000
1 <= N <= 10^4
1 <= A[i] <= 10^5

<b>Sum of "N" over all testcases does not exceed 10^5</b>For each testcase you need to return the sorted array. The driver code will do the rest.Sample Input:
2
3
3 1 2
3
4 5 6

Sample Output:
1 2 3
4 5 6, I have written this Solution Code: function quickSort(arr, low, high)
   {
        if(low < high)
        {
          let pi = partition(arr, low, high);

            quickSort(arr, low, pi-1); 
            quickSort(arr, pi+1, high);


        }
        return arr;
   }

   function partition(arr, low, high)
   {
     let pivot = arr[high];  
        let i = (low-1); // index of smaller element 
        for (let j=low; j<high; j++) 
        { 
            // If current element is smaller than the pivot 
            if (arr[j] < pivot) 
            { 
                i++; 
  
                // swap arr[i] and arr[j] 
                let temp = arr[i]; 
                arr[i] = arr[j]; 
                arr[j] = temp; 
            } 
        } 
  
        // swap arr[i+1] and arr[high] (or pivot) 
        let temp = arr[i+1]; 
        arr[i+1] = arr[high]; 
        arr[high] = temp; 
  
        return i+1; 
   }, In this Programming Language: JavaScript, Now tell me if this Code is compilable or not?