What is the time complexity of merge sort in the worst-case scenario?

  • O(log n)
  • O(n log n)
  • O(n)
  • O(n^2)
The time complexity of merge sort in the worst-case scenario is O(n log n), making it an efficient algorithm for sorting large datasets. This complexity arises from its divide-and-conquer approach.
Add your answer
Loading...

Leave a comment

Your email address will not be published. Required fields are marked *