2 votes 2 votes The time complexity to build a heap with a list of n numbers is O(log n) O(n) O(n logn) O(n$^2$) DS heap-sort ugcnetcse-june2013-paper2 + – shivani2010 asked Jun 15, 2016 shivani2010 1.9k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 6 votes 6 votes It will take $O(n)$ time. Hence option B is the correct one. Here is a detailed explain is given. I am sure you will find this facinating. rude answered Jun 15, 2016 selected Sep 23, 2016 by Sankaranarayanan P.N rude comment Share Follow See all 0 reply Please log in or register to add a comment.