edited by
371 views
1 votes
1 votes

Consider the following sequence $( 50,17,14,8, 13,10, 2,5,7,12)$ what is the Minimum number of interchanges required to make it Max heap?

  1. $4$
  2. $2$
  3. $3$
  4. $0$
edited by

1 Answer

Answer:

Related questions

0 votes
0 votes
1 answer
2
Bikram asked Nov 26, 2016
1,637 views
Three algorithms do the same task. Algorithm One is $O(N)$ and Algorithm Two is $O(\log N)$ and Algorithm Three is $O(N1/2)$. Which algorithm should execute the fastest f...
1 votes
1 votes
3 answers
3
0 votes
0 votes
0 answers
4