1.

The complexity of merge sort algorithm is

A. O(n)
B. O(log n)
C. O(n<sup>2</sup>)
D. O(n log n)
Answer» E.


Discussion

No Comment Found