MCQs > IT & Programming > Computer Science > 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

Computer Science MCQs

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


Answer

Correct Answer:

o(n)

Explanation:

Note: This Question is unanswered, help us to find answer for this one

Computer Science Skill Assessment

Overall Skill Level-Poor

Your Skill Level: Poor

Retake Quizzes to improve it

search

Computer Science Skill Assessment

Overall Skill Level-Poor

Your Skill Level: Poor

Retake Quizzes to improve it