One of the key advantages of merge sort is its _______ time complexity in all cases.
- O(log n)
- O(n log n)
- O(n)
- O(n^2)
One of the key advantages of merge sort is its O(n log n) time complexity in all cases. This makes it more efficient than some other sorting algorithms, especially in scenarios with large datasets.
Loading...
Related Quiz
- How does Quick Sort handle duplicate elements during its sorting process?
- Can you explain the time complexity of the Ford-Fulkerson algorithm and identify any potential optimization techniques?
- Linear search is _______ efficient for searching large datasets.
- Bubble sort is not recommended for large datasets due to its _______ time complexity.
- The optimal substructure property ensures that the solution to a subproblem can be used to solve the _______ problem.