analysis of merge sort|merge sort time complexity analysis

[@mdmasudrana-rs2gj]

This video makes me more understandable ❤. Thank you so much sir. Before midterm exam now I am hero to find out t.c for mergesort

[@SudhakarAtchala]

All the best. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@WinterArc-k3l]

Thank you sir for both merge and quick sort❤❤❤

[@SudhakarAtchala]

So nice of you. Please like the videos, subscribe to the channel, and share it with your friends. Thanks in advance.

[@akilashraful]

totally a underrated video.

[@SudhakarAtchala]

Okay 👍. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@aswinjune05]

Pls don't quit this sir. It's very useful for us

[@SudhakarAtchala]

Thanks. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@rsamhitha4707]

I Appreciate your efforts sir

[@SudhakarAtchala]

Thanks. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@aswinjune05]

Such a wonderful explanation. Thank u soonuch sir

[@SudhakarAtchala]

Most welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance

[@danyalhabib286]

Best Explanation Sir 👏

[@SudhakarAtchala]

Thanks and welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@xenonman7677]

Gajab efforts... Hat's off❤

[@SudhakarAtchala]

Thanks

[@siddireddyvignesh]

Thank you sir for this wonderful explanation

[@SudhakarAtchala]

Most welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@sajawaljutt4105]

Thank you so much sir i have subscribed to your channel

[@SudhakarAtchala]

Welcome

[@gowthamgowtham9643]

Thank you sir for this video ,I request you to upload derivation of Time complexity of all sorting algorithm 1:44

[@SudhakarAtchala]

Plz go to my data structures playlist. I have uploaded analysis of each and every sorting technique . Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@pavaniguddoji-cl1bb]

Super........sir explain other sorting technique algorithms and time complexities before my exams sir actually i am already shared yur videos my friends sir

[@SudhakarAtchala]

Already all sorting techniques uploaded. Type Sudhakar data structures then you will get the playlist

[@pavaniguddoji-cl1bb]

@@SudhakarAtchala sir thankyou .. but I want time analysis of bubble sort,selection,insertion sort sir....please once explain

[@SudhakarAtchala]

In every sorting technique, at the end analysis is also explained

[@manishkumar-uw5mw]

Awesome sir. .from IIT

[@SudhakarAtchala]

Thanks. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@Harshwardhan12345]

Thnks so much sir

[@SudhakarAtchala]

Most welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@3_nu]

Thank you sir.

[@SudhakarAtchala]

welcome. Please like the videos, subscribe to the channel, and share it with your friends. Thanks in advance.

[@OIAOa]

thanku sir

[@SudhakarAtchala]

Most welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@user-dv5in1co9o]

Thanks sir ❤❤

[@SudhakarAtchala]

Most welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance...

[@mohdfarhan4038]

Thank you sir

[@SudhakarAtchala]

Hai Farhan , Thanks for your encouragement and support towards our channel.Share my sessions with your friends and subscribe to our channel.Keep on following my sessions. Thank you so much.

[@SudhakarAtchala]

Pls go through my data structures playlist once. Definitely you will like more videos. Thank you so much.

[@krishnan828]

How is 2^K=n?

[@SudhakarAtchala]

That is an assumption, to derive time complexity in terms of log. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..

[@deekshithpatel7191]

sir why quick sort and merge sort time complexity alg are same..!

[@SudhakarAtchala]

Worst case t.c of quick sort is O(n2) where as ms is 0(n log n). Both work based on divide and conquer alg. That's why best and avg case same. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@waseemahmed7919]

why +n is not explained? please explain why + n is in equation

[@SudhakarAtchala]

minimum n comparisons for merging. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.

[@Nainalarenukadevi9196-dh8rz]

whu u taken 2powerk equal to n

[@SudhakarAtchala]

To write 2powk in terms of n. 2powk=n