ISRO 2024

Question

Worst case time complexity of heap sort for n elements

1. O(nlogn)
2. O(logn)
3. O^2
4. O(n)

Answer 1

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.