0 votes 0 votes Show that the worst case running time of heap sort is Ω(nlogn). Algorithms algorithms time-complexity + – Upasana singh asked Nov 7, 2017 Upasana singh 149 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.