0 votes 0 votes The time complexity to build a heap of n elements is $0(1)$ $0(lgn)$ $0(n)$ $0(nlgn)$ Algorithms ugcnetcse-dec2010-paper2 algorithms time-complexity + – makhdoom ghaya asked Sep 7, 2016 • recategorized Oct 8, 2018 by Pooja Khatri makhdoom ghaya 1.7k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 1 votes 1 votes Answer: C Building a heap takes O(n). If you are looking for an explanation, here it is http://stackoverflow.com/a/9755805 Rakеsh Kumar answered Sep 7, 2016 • selected Sep 8, 2016 by vijaycs Rakеsh Kumar comment Share Follow See all 0 reply Please log in or register to add a comment.