MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
| 1. |
What is its wort case time complexity of Heap sort? |
| A. | O(nlogn) |
| B. | O(n<sup>2</sup>logn) |
| C. | O(n<sup>2</sup>) |
| D. | O(n<sup>3</sup>) |
| Answer» B. O(n<sup>2</sup>logn) | |