0 votes 0 votes Worst case time complexity of heap sort for n elements O(nlogn) O(logn) O^2 O(n) Algorithms isro-2024 algorithms heap-sort sorting + – Ramayya asked Jan 7 • retagged Jan 7 by Hira Thakur Ramayya 209 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Heap sort gives the worst case when array elements are sorted in reverse order. so the time complexity should be $O(nlogn)$ Option $(A)$ is correct. Hira Thakur answered Jan 7 Hira Thakur comment Share Follow See all 0 reply Please log in or register to add a comment.