Merge sort in 3 minutes

great vid! simple and easy to understand for a review

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

Internet Gold.

i hate this kind of sort , it is not pretty and i don't know how is this performant

new sub! great videos! thanks ! we need another video with RadixSort please!

could this be made in linear time by representing arrayOne, arrayTwo as linkedLists? that way removing the first element is constant time, rather than linear time?

I.e in the first while loop of the merge function, there is a command remove a[0] from a. This is O(n), since all the other elements in the array need to be shifted to the left. However, with linked lists, this corresponds to removing the head of the list, which is O(1). Can't see any potential issues with using linked lists elsewhere? Would just have to write splicing functionality for them.

Edit: I am going to try and implement both ways, the way in this video and using a linked list and see what the results are. Will reply to this comment when I have a result

dumb ass video

Please do a video on how the actual recursive stack works with this algorithm. That's the confusing part for me.

what is n?

This was a miss, this is not really how you do it algorithmically, way too simplified

thank you very much, its very helpful

this is exactly what i was looking for

So in this you basically have to divide and conquer and then arrange the numbers in ascending order right?

what to do when there is odd number?

Awesome video, way better than my professor!

Thanks for your videos sir. I got an "A" for data structures and algorithms module.

RESPECT

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

what will happen if the element of array is odd?

thnk u , it help me

Thank you so much. Looked at my uni lecture slides and dint understand a single bit of it. Watched your vids and totally understood it. Thank you very much❤

Thank you for the helpful video!

this was firee homie

You should make another video explaining the merge sort psuedo code as well. The diagram helped me understand but the code at the end seemed a bit hand wavy for to me to understand.

gracias bro

The algorithm is one thing. Implementing it c or other programming language is the real deal. When i first implemented it in university you call a function tha passes an array, the first index of the array 0 called min and the last index n-1 max. As long as min<max you calculate middle =(min+max)/2 and you call two consecutive margesort function passing A the array, min and middle fort the first
and A,middle+1,max for the second. The real deal is another function called marge that passes A,min,max,middle.

Thank you!!!!!!!!!!!

thx

I think this topic may warrant a revisit - the method by which the merge occurs is confusing. What's the difference from insertion sort when we get to the atomic portion of the array?

Please do a video on Knuth-Morris-Pratt algorithm! 🙏🏼

NOICE NOICE

it is conquer and divide
u r wrong

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

Why do I pay for University when I got this man wtf

what if the array has a length of 9? how does the splitting look like then

What happens if you don't have the perfect amount to split ? Ie 11 elements in an array

Is this matlab??

ok so in the 2nd part after the split up your Algorythm magically puts the elements into the right order??

Thanks very much again Michael. You are awesome!

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.

how is this different from radix?

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

HAHAHAHAHAHAHAHAHAHAHAHHAAHAHAHAHAHAHHAHAH

thanks

So you divide, than you merge?

The merging part Itself needs to be more explained it seems a bit mysterious to me going from elements to a set of 4

Dang it. You could've saved more time by speeding up the animation. Great content btw!

bad explanation. 👎👎
your animation is innacurate with the flow of code
shame