What is the best-case time complexity of Merge Sort?

Options

  • A. O(n)
  • B. O(log n)
  • C. O(n log n)
  • D. More than one of the above
  • E. None of the above

Correct Answer (Detailed Explanation is Below)

C. O(n log n)

Detailed Explanation

Merge Sort has a best-case time complexity of O(n log n). Even if the input array is already sorted, the standard Merge Sort algorithm still divides the array recursively and performs the merging process. Therefore, unlike some optimized algorithms, its best, average, and worst-case time complexities are generally O(n log n). This predictable performance is one reason Merge Sort is useful when a guaranteed upper bound on sorting time is important.
← Previous Next →

Attempt Quiz Now:

BPSC TRE 4 DSA Practice set 1

Feature Posts