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.
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.
| praneethmamidala83 | 583 |
| pallavimanukonda8 | 563 |
| a8haysingh | 451 |
| vraamg | 432 |
| RajatGarg5 | 386 |
| descifrador | 1683 |
| mantu_singh | 1504 |
| rishabh2017 | 1263 |
| gladiator121 | 1224 |
| kid_kb | 1205 |
| blackshadows | 5362 |
| Ibrahim Nash | 5244 |
| akhayrutdinov | 5111 |
| mb1973 | 4974 |
| Quandray | 4720 |