The heap sort method has a worst case complexity function that is in
A) O(log n)
B) O(n.
C) O(n2.
D) O(n log n.

Question

Quizplus · Accepted Answer

The worst case complexity of heap sort is O(n log n), making choice D the correct answer. Choices A and B are not correct because a logarithmic function grows slower than a linear function. Choice C is also not correct as it represents a quadratic function, which grows significantly faster than a logarithmic or linear function.

The Heap Sort Method Has a Worst Case Complexity Function