Merge sort in 3 minutes

Step by step instructions showing how to run merge sort.

Sources:

[CamFocusApp]

For people who didn't understand the merge part like I didn't when I watched this here's an explanation. when we finalize the divifing into smaller arrays part, we will have arrays from which we always know the smallest item, which is the left most. so we compare the left most item from each array and the smaller one we put it first into the bigger array. and we do that until we complete the bigger array.

[kanrup]

The merging part itself needs to be more explained, it seems a bit mysterious to me going from two element pairs to a set of four elements.

[VinodMoorkoth]

"Inserting items in correct order." - That's the whole algorithm isn't it?

[dbella]

Thank you so much, for simplifying these concepts. It was very difficult for me until I watched your videos.

[WingedGlider]

Thank you for being so simple and concise with your explanations. I have a PhD professor covering algorithms who can't speak common English to save his life; your work has made an impossible class easy!

[koshka]

Man, you summarize hours of lectures into clean, concise, easy to follow steps. Thank you.

[ibrahimfaiz]

Your videos sum up my classes in just a couple of minutes. Amazing work!! Life saver!

[AbinashAdhikari]

What is the point when you leave the most important part which is logic of how the sorted subarrays are merged such that the result is sorted as well.

[adognamedcarlo]

Many thanks Michael. Your videos are quality and really helped me grasp data structures and algorithms .

[brendabrownofficial]

You are such a great teacher, universities need more professors like you <3, thank you!

[richardtwitty]

Wow, you did a better job than any other youtube video with 3 min. Thanks!

[brycehoch]

Thank you so much for these videos. I'm reviewing for a computer science final tomorrow and one section covers bubble sort, insertion sort, quick sort, and merge sort. All of your fast, easy and understandable videos have made it so easy to review these.

[drditup]

this is amazing. no fluff, no babbling. just a direct explanation. im so used to people talking for an extra 20 minutes when this is all it takes. great, just great

[daikikaminari]

Thank you so much !
I was stuck for hours and this video helped me understand how it was actually working and then it was easy to implement :)

[tianhaowang]

clean screen， detailed explanation， thanks for the work you have done！！

[dorgn]

A great explanation up to the point, Thank you so much!!

[rcgldr]

Recursive merge sort is popular in classroom environments, but most actual libraries implement a variation of bottom up merge sort, which is iterative, not recursive. Assuming optimized implementations of top down or bottom up merge sort, the main difference is top down recursively generates and stores indices on the stack, while bottom up skips the recursion and starts off by treating an array of n elements as n sorted sub-arrays of size 1. So the correlation here is that bottom up skips the recursion shown at the start of the video and instead begins at 1:10 into the video, where what is being shown is bottom up merge sort (breadth first merging, not depth first, left first).

[aniruddhkarekar]

Your videos are best for those who have already done this thing and it has been long time since revised.

[srinivasnangunuri]

simplest explaination on Merge sort. Bravo!

[salthesadmanshark]

I read the wiki article and saw bunch of other yt videos but couldn't write this myself, but this video helped me finally write a top_down mergesort algo in ruby. So thanks a lot for the video.