MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
| 1. |
What will be the best case time complexity of merge sort? |
| A. | O(n log n) |
| B. | O(n<sup>2</sup>) |
| C. | O(n<sup>2</sup> log n) |
| D. | O(n log n<sup>2</sup>) |
| Answer» B. O(n<sup>2</sup>) | |