Solution:

1:c
2:b
3:b
4:a
5:b
6:a
7:a
8:c
9:a
10:e

For a better understanding of fundamental aspects of data structure and algorithms read domyhomework. You can find info on this algorithm there too.

how can i check my answer???

Hi.i can't clearly understand about the algorithm.can u explain me

Which of these is the time complexity involved in building a heap of n elements - and cannot be expressed in lower order terms ? How come the answer is not o(nlogn)? If you are talking about heap then it must be min heap or max heap.Max/Min heapify takes o(log(n)).So it should be o(nlogn).Please let me know if i am missing something.