Heap sort is O(________).
A) n
B) log n
C) n log n
D) None of the above

Name: Heap sort is O(________). A) n B) log n C) n log n D) None of the above
Brand: Quizplus
Rating: 4.8 (40 reviews)

Question

Quizplus · Accepted Answer

Heap sort has a time complexity of O(n log n) because it involves building a heap from the input data, which takes O(n) time, and then repeatedly extracting the maximum element from the heap and rebuilding the heap, each of which takes O(log n) time, for a total of n elements.

Heap Sort Is O(________)