engineering recuitment NIC NIELIT Scientist B 2023 Mock Test Algorithms Searching, Sorting and Hashing Sorting
Consider the following array of elements
<70, 23, 60, 19, 13, 16, 1, 4, 8, 12, 7, 10, 85>
The minimum number of interchanges needed to convert into a max-heap is
1
2
2
4
3
3
4
1