top button
Flag Notify
    Connect to us
      Facebook Login
      Site Registration Why to Join

Facebook Login
Site Registration

How do merge sort and quick sort differ? They both runs in O(n log n) complexity?

0 votes
33 views
How do merge sort and quick sort differ? They both runs in O(n log n) complexity?
posted Oct 3, 2018 by anonymous

Share this question
Facebook Share Button Twitter Share Button LinkedIn Share Button

1 Answer

0 votes

T(n)=3T(n/2)+n^2 give expression for runtimeTn if recursion can solve through mastertheorm otherwise indicated mastertheorm dosn't apply

answer Oct 6 by Srishty Dimri
Contact Us
+91 9880187415
sales@queryhome.net
support@queryhome.net
#280, 3rd floor, 5th Main
6th Sector, HSR Layout
Bangalore-560102
Karnataka INDIA.
QUERY HOME
...