Question: The running time of merge - sort algorithm is ? Question 2 options: d ) O ( n * logn ) b ) O (

The running time of merge-sort algorithm is?
Question 2 options:
d) O(n*logn)
b) O(1)
a) O(n)
c) O(n*n)

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 Programming Questions!