Heap Sort Problem Statement

Your task is to sort an array of integers in non-decreasing order using the Heap Sort algorithm.

Input:

The first line contains an integer 'T' denoting the number of test cases. Each test case consists of two lines: - The first line contains a single integer 'N', the number of elements in the array. - The second line contains 'N' space-separated integers, the elements of the array.

Output:

For each test case, output 'N' space-separated integers sorted in non-decreasing order. Each test case's output should be on a separate line.

Example:

Input:

2 4 4 10 3 5 3 9 7 6

Output:

3 4 5 10 6 7 9

Constraints:

1

Question

Heap Sort Problem Statement

Your task is to sort an array of integers in non-decreasing order using the Heap Sort algorithm.

Input:

The first line contains an integer 'T' denoting the number of test cases.
 Each test case consists of two lines:
 - The first line contains a single integer 'N', the number of elements in the array.
 - The second line contains 'N' space-separated integers, the elements of the array.

Output:

For each test case, output 'N' space-separated integers sorted in non-decreasing order.
 Each test case's output should be on a separate line.

Example:

Input:

Output:

3 4 5 10
6 7 9

Constraints:

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

Note:

Implement the function; you do not need to handle any printing as it has been managed externally.

Accepted Answer

Heap Sort is used to sort an array of integers in non-decreasing order by creating a max heap and repeatedly extracting the maximum element.

Create a max heap from the input array.
Swap the root (maximum element) with the last element and reduce the heap size.
Heapify the root element to maintain the heap property.
Repeat the above steps until the heap size is 1.
The array will be sorted in non-decreasing order.