2 votes 2 votes Show that the worst case time complexity of MAX_HEAPIFY is Ω(logn ) . Algorithms algorithms binary-heap + – dragonball asked Nov 10, 2017 dragonball 207 views answer comment Share Follow See 1 comment See all 1 1 comment reply smsubham commented Dec 27, 2017 reply Follow Share See this https://math.stackexchange.com/questions/181022/worst-case-analysis-of-max-heapify-procedure 0 votes 0 votes Please log in or register to add a comment.