Beginner
Data Structures & Algorithms
Q27 / 100
What is the time complexity of merge sort?
Correct! Well done.
Incorrect.
The correct answer is B) O(n log n)
B
Correct Answer
O(n log n)
Explanation
Merge sort divides the array into halves (log n levels) and merges them (O(n) per level), giving O(n log n) in all cases.
Progress
27/100