Which of the given options is the correct time complexity to build the heap of input array in the following algorithm?
CREATE-HEAP(B)
size := size(B);
forj := floor(size/2) d0wnto1
do HEAP(B, j);
and for
END
Correct Answer:
o(n)
Explanation:
Note: This Question is unanswered, help us to find answer for this one
More Computer Science MCQ Questions