Q.

The complexity of merge sort algorithm is

A. O(n)
B. O(log n)
C. O(n log n)
D. None of these
Answer» C. O(n log n)
689
0
Do you find this helpful?
1

Discussion

No comments yet