Question: Why binary seach has O(log(n)) but Merge sort has O(n*log(n)) complexity? Explain with proper reasons and examples

Why binary seach has O(log(n)) but Merge sort has O(n*log(n)) complexity? Explain with proper reasons and examples

Step by Step Solution

3.39 Rating (146 Votes )

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