The best-case time complexity of Merge Sort is O(n log n), as it always divides the array regardless of the order.
