Question: The complexity of Merge Sort algorithm is I. O ( n ) II . O ( log n ) III. O ( n ^ 2

The complexity of Merge Sort algorithm is
I. O(n)
II. O(log n )
III. O(n^2)
IV. O(n log n)
V. None of the above

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!