Merge Sort has time complexity O(___).
A) O(n^2)
B) b)O(n)
C) c)O(nlog(n))
D) d)O(n^2)

Name: Merge Sort has time complexity O(___). A) O(n^2) B) b)O(n) C) c)O(nlog(n)) D) d)O(n^2)
Brand: Quizplus
Rating: 4.9 (30 reviews)

Question

Quizplus · Accepted Answer

Merge Sort has a time complexity of O(nlog(n)) in all cases (worst, average, and best scenarios) because it divides the list into two halves, recursively sorts them, and then merges the sorted halves.

Merge Sort Has Time Complexity O(___)