0 votes 0 votes Algorithms heap-sort + – hem chandra joshi asked Nov 25, 2017 hem chandra joshi 491 views answer comment Share Follow See 1 comment See all 1 1 comment reply Red_devil commented Nov 26, 2017 reply Follow Share i think first we need O(n) comparisions to build a heap and than every time we extract an elemnt from heap we need max of logn comparisons,,there are n elements so (nlogn +n ) comparisions are needed so O(nlogn) 1 votes 1 votes Please log in or register to add a comment.
