Merge Sort Algorithm : Divide and Conquer Technique : Think Aloud Academy

This video talks about Merge Sort Algorithm, a divide and conquer technique for sorting elements
1. Merge Sort Algorithm Introduction
2. Merge Sort Algorithm Example
3. Merge Sort Algorithm
4. Analyzing the algorithm with the example
5. Time Complexity of Merge Sort Algorithm
This video is brought to you by www.thinkaloudacademy.com
Keywords:
Algorithms, Algorithm, Computer Algorithm, Computer Algorithms, Algorithm Design, Algorithm Design and Analysis, Analysis of Algorithms, Anany Levitin, Levitin, Divide and Conquer, Divide and Conquer Technique, Merge Sort, Merge Sort Algorithm, MergeSort, MergeSort Algorithm, Mergesort, Mergesort Algorithm, Merge sort, Merge sort Algorithm, Time Complexity, Think Aloud Academy, Amitkeerti, Amitkeerti Lagare, Niharika, Niharika Kumar, www.thinkaloudacademy.com

[@TheAmericanEagle100]

Great Tutorial, very informative, complete and to the point. The best explanation of the mergesort algorithm that I have seen so far. Great Job!

[@manishsrivastava4698]

Nicely explained merge sorting logic, algo and time complexity,
Thanks a lot.

[@adarsh7604]

definitely the best merge sort video on youtube!

[@Balakrishnan1991]

really really good explaining as khanacademy and udacity.
Thank you really.
Please continue teaching us.

[@GotzilaZaGG]

This video is made me clear about merge sort.
Thanks you really.

[@dheeraj388]

mind blowing sir I get completely understand the concept

[@arvindsrinivas786]

Great video.Cleared my confusion. Thank you very much.

[@sagargawande3813]

u r awesome virtual teacher...!!

[@shailjakantupadhyay5183]

once again thanks sir, for explaning each and every thing in very clear manner

[@sriharsha6460]

the video is reall good and easy to understand. very helpful at the time of xams. thank uuu.

[@SanchitSaxenaLive]

Nice explaining done ... understood this today ...

[@rakibhossain825]

best tutorial for Merge Sort Algorithm.

[@rahulreddy6423]

All your video's are awesome.........

[@hemalatha2261]

tqu sir this vedio is very help full to understand the concept of merge sort

[@ShiekhDawood]

really learn from this video.., thanku very much

[@saimanasadevialapati4245]

thankyou so much sir
i have gone through few of ur lectures ...
they were very clear and easy to understand
thank you so much sor

[@somiafazal7394]

excellent video..Thank u sir

[@abdelmuniemabdallah4116]

Good Explanation,
Thanks so much

[@ashpatthi]

Well explained.. thanks a lot...

[@asteriosk]

Great work! Thanks!

[@Abbadon2]

rly BIG thanks for making this video!!!

[@gobbledee55]

Awesome video!

[@msriharsharao]

Very good presentation.

[@Seshasravani]

awesome work!!!

[@buttegowda]

Awesome ... thanks a lot.

[@vishalnimkar8246]

Nice tutorial...keep it up...!

[@shailjakantupadhyay5183]

extremely good sir

[@rubbeldiekatz85]

thank you very much. That was very helpful

[@visharyan]

Thanks a lot Amit :)

[@akshitagarwal1309]

QUITE HELPFUL !!! THNX A TON !!!

[@MuthuKumarpkt]

Thank you so much now i got it how do the merge sort

[@koolakhoo]

excellent !!

[@srinivas1209]

good work.

[@كنداكة-ه3د]

Big likeee
Thanks

[@newmwafaq]

Thank u so much sir. may i know what program u used to create ur video tutorials?

[@420b024]

best tutorial

[@Shridhar26]

Super !

[@mr.kishorkumar1948]

thank you sir

[@vivekvuppala39]

Nice. Can you please explain Heap sort like this?

[@TheRorojust]

thank uu so much

[@obaid_kakar]

very nice

[@83abhinavnigam]

in this implementation are the arrays A,B,C passed through reference or by value?

[@pradeepkumarl1983]

Hi.. I have one question. I don't know understand how the merge sort method gets called after the first call to merge method with 2elements. Could you please explain. Thanks in advance.

[@asfand182]

nice

[@teezo3afana]

when he says "merge sort" he sounds like a Pokemon calling his name

[@millionsdreams6179]

the best one

[@Survivor662]

+himanshu sadashiv OMG

[@deepakborah8335]

Good enough

[@chriszep21]

If I have twelve numbers, how do I split? If I divide by two, I got 6, If I divide by two again, I got three... How can these be sorted? Should I divide twelve by 3 and get three unsorted lists of 4 elements each?

[@abhishekmitra4222]

Why is i not equal to p while sorting the B array and why is it equal to p while sorting the C array?

[@stevo946]

Very nice Mozart algorithm

[@chubowu]

I prefer the Beethoven algorithm

[@larrypark7179]

boo

[@ravenwda007]

Thanks for teaching the merge sort. Its is simple.
Most important rule in programming: Keep it simple stupid

[@WeAreWave]

thanks..
i keep hearing "mozart algorithm".. maybe because i play violin..

[@GnumpStonetoe]

"right and wrong".. -.- Even if there were no accents in a language at one given time, they will still speak with an accent compared to how that language was spoken before. For example, some hundred years ago people would consider your "right" way of speaking a weird accent.

[@GautamSingh-yn9cb]

the global view of merge sort does not actually depict the real mechanic,in fact its wrong, arrows should show real flow of the algo, the return arrows should be there

[@ravenwda007]

no you always divide by 2.
This is a recursive sort, which means it calls itself many times. Listen to what he says about the parent and child groups.

[@YeisonSoto]

ummm
ç