Given an array of size N. The task is to sort the array elements by completing functions heapify() and buildHeap() which are used to implement Heap Sort.
Input:
First line of the input denotes number of test cases T. First line of the test case is the size of array and second line consists of array elements.
Output:
Sorted array in ascending order.
Constraints:
1 <= T <= 100
1 <= N <= 106
1 <= arr[i] <= 106
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: After sorting elements using heap sort, elements will be in order as 1, 3, 4, 7 and 9.
| mohamadhegazy97 | 57 |
| ManojBharadhwaj | 49 |
| bhatabhi554 | 48 |
| adityak12 | 48 |
| RaghavJindal | 47 |
| blackshadows | 940 |
| SunkyuHwang | 794 |
| bently_nixon | 701 |
| mb1973 | 491 |
| Shaurya Khanna | 491 |
| akhayrutdinov | 5043 |
| Ibrahim Nash | 4967 |
| blackshadows | 4640 |
| Quandray | 4354 |
| sanjay05 | 3668 |