Try this exercise. Click the correct answer from the options.
The worst-case scenario time complexity of the MergeSort algorithm is:
Click the option that best answers the question.
- O(n)
- O(1)
- O(N logN)
Back to course sections
Mark As Completed Discussion