MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
| 1. |
What is the typical running time of a heap sort algorithm? |
| A. | O(N) |
| B. | O(N log N) |
| C. | O(log N) |
| D. | O(N<sup>2</sup>) |
| Answer» C. O(log N) | |