Given an array of integers. Complete the partition() function used for the implementation of Quick Sort.
Input:
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. The first line of each test case is N, size of the array. The second line of each test case contains N space separated values of the array arr[].
Output:
For each testcase, in a new line, print the sorted array.
Your Task:
You don't need to read input or print anything. Your task is to complete the function partition() which takes the array arr[] and the range of indices to be considered [low, high] and partitions the array in the given range considering the last element as the pivot such that, all the elements less than(or equal to) the pivot lie before the elements greater than it.
Expected Time Complexity: O(n).
Expected Auxiliary Space: O(1).
Constraints:
1 <= T <= 50
1 <= N <= 103
1 <= arr[i] <= 104
Example:
Input:
2
5
4 1 3 9 7
10
10 9 8 7 6 5 4 3 2 1
Output:
1 3 4 7 9
1 2 3 4 5 6 7 8 9 10
Explanation:
Testcase 1: Elements in sorted form are 1 3 4 7 9.
Testcase 2: Elements in sorted form are 1 2 3 4 5 6 7 8 9 10.
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.
| abnandi04 | 801 |
| KshamaGupta | 560 |
| mummy | 322 |
| NikhilGupta0301 | 260 |
| jagseersinghbe18cse | 251 |
| abnandi04 | 776 |
| KshamaGupta | 444 |
| mummy | 235 |
| srivastavad270 | 223 |
| bhavyapratap56 | 206 |
| blackshadows | 5362 |
| Ibrahim Nash | 5244 |
| akhayrutdinov | 5111 |
| mb1973 | 4976 |
| Quandray | 4748 |