

MCQOPTIONS
Saved Bookmarks
1. |
What is the worst-case time for heap sort to sort an array of n elements? |
A. | O(log n). |
B. | O(n). |
C. | O(n log n). |
D. | O(n²). |
Answer» D. O(n²). | |