Quick Sort Problem Statement

You are provided with an array of integers. The task is to sort the array in ascending order using the quick sort algorithm.

Quick sort is a divide-and-conquer algorithm. It involves selecting a pivot point and partitioning the array into two segments: the left one containing elements smaller than the pivot and the right one with elements larger than the pivot. Thereafter, recursively sorting the two partitions.

Input:

The first line contains an integer 'T', the number of test cases.
For each test case:
The first line contains an integer 'N', representing the size of the array.
The second line contains 'N' space-separated integers representing the array elements.

Output:

For each test case, output a single line containing the array elements sorted in ascending order, separated by spaces.
Each test case's result appears on a separate line.

Example:

Input:
1
5
4 2 1 5 3
Output:
1 2 3 4 5

Constraints:

• 1 <= T <= 10
• 1 <= N <= 10³
• -10⁹ <= ARR[i] <= 10⁹

Note:

You are not required to implement any print functionality; focus on developing the sorting function itself.

Follow-Up:

Can you enhance the algorithm to achieve NlogN complexity in the worst case?