Learn Merge Sort in 13 minutes 🔪 

This video took me THREE WEEKS to produce! Ya'll better smash that like button for me! lol public class Main{ public static void main(String args[]) { // merge sort = recursively divide array in 2, sort, re-combine // run-time complexity = O(n Log n) // space complexity = O(n) int[] array = {8, 2, 5, 3, 4, 7, 6, 1}; mergeSort(array); for(int i = 0; i < array.length; i++){ System.out.print(array[i]+ " "); } } private static void mergeSort(int[] array) { int length = array.length; if (length

The way you broke this down into simple terms with visuals and everything, amazing. I'm not a bro, but I do code. And this was lit. Thank you.

You are single-handedly teaching me programming/computer science. Thank you. Never change your teaching structure, because this method works really well.

I knew when I saw "Bro Code" it would be a beautifully simple video. What you did that the other videos I watched failed to do was walk through the sort / merge in the order that it would actually happen. The other videos were doing it by rows and not the actual order that it happens in. Thank you ! That is what made it click for me. I am now subscribed !

This is the best video I found on all youtube which explains Merge Sort properly. This video is the definition of Quality Content.

Bro, you are a legend. My professor went over merge sort for 1 1/2, and I was left confused. I watched a Harvard lecture video on it, still confused. Asked chatGPT about individual components (not to cheat but to have it explain each step to me, I want to understand this) and it was spewing nonsense. But your video made it finally click. Thanks bro! Liked and subscribed

Best explanation I've seen so far. The rundown at the beginning really helps. Thank you

So clear. my professor did not have enough time to go over this in class. Now I understand everything about merge sort.

You are a great tutor sir, I appreciate, I was failing to understand this all along, but just because of your video, I feel confident enough

Idk you sounds more confident in recent new videos, keep going homie you still gotta reach more people👍

First of all I just wanted to let you know that thanks to your java section I landed a job as a java developer. So ...from the bottom of my heart, thank you, keep up the good work! On the other hand, a question for this video: what if the array has an odd length ?

I'm on a journey of learning DSA ... I've got to say, you explain things very well! Glad I've stumbled on your channel.

Great video. I needed to implement this in C for a CS class and this video explained it in much clearer and easier to follow way than the so called experts who are being paid 6 figures a year to teach this to me. Ty bro.

You made mergeSort look so simple and easy, thank you so much!

Thank you for the beautifully elegant explanation that didn't require the viewer to have a PhD. You are one talented bro. Keep it up!

Probably the best video i've seen so far to explain Mergesort, i think i finally got it!

After 2 years this is still very useful i understand everything now . even though i don't know how to use java i've just learned c++ but everything is clear now

Recursive algorithms are the bane of my existence.

We’re passing Oneil’s class with this one 🗣️🗣️🔥

Good job! It is really easy to understand the algorithm with this video, thank you

this helps me understand how the algorithm works, thank you bro for this detailed explanation. ^_^

You are the best Bro I never had. 2 years have gone by, but this is still amazing.

No words can explain my appreciation Thank you, sir 🏆🏆🏆🏆

Trying to make these algorithms with blueprint nodes in UE5, and following along with your code is also helping me translate code jargon into blueprint equivalents. Thank you for sharing

Thank you man!!! Finally I have found the best explanation of merge sort! You really helped us a lot. I've alredy smashed the like button, you deserve it bro!!!

it'd be really helpful if you continue this playlist!!! thanks in advance

Clearly explanation and demonstration with merge sort, great work!!! Can,t wait for more CS videos.

this video is one of the best one that I've ever watched

Best merge sort tutorial I've seen, thank you

The best merge sort explanation on RU-vid. Watched like 5 other videos but only this explained how the merge part of merge sort actually works! Liked and subscribed.

Wow you are one of the best RU-vidrs to explain algorithms

nice job, simple explanation of a long algorithm

Thank you so much bro. My lecturer in campus and his slides are so confusing and it makes me think merge sort is difficult as hell. However your video explained it's so simple so i can understand it better and it's not that hard

Great video man, I understood everything so quickly, thank you so much and keep coding bro

The best merge sort explanation! Thank you so much.

If you ever publish a book, I'd be the first one to buy it. Excellent work, Bro. 🙏

Bro, youre helping me through college. I appreciate it

Thanks man! , because of you , i can skip the tough work of learning, hehe, and straight jump into implementing algorithms

Best explanation of merge sort so far!

Thank you for saving me from my final test. You are the best teacher

You just made my computer science assignment a whole lot easier lol. Thank you.

top content as always. No one more understandable than Bro! (I hope you doin good on your break!!!)

Wow! this is a good tutorial. Thank you very much for taking the time to put it together! Well Done!

this really helped me understand merge sort. thanksss a lot

Good video, not too long, not too short. Great job.

Nice. Thanks for the video!

Started your Java playlist love your tricks to teach... Appreciate from another fellow BRO.

That's terrific! I'm working my way thru your videos. Wish I found your channel earlier.

Needed this for my interview :))) thank you!

Really helpful video, thank you!

Thankyouuuuusomuch, your video really helps our group "MEMANG".

very well explained, Thank you very much

how i actually understood everything just from the visualisation in the beggining wrote the whole program by myself and then watched the rest of the video and my logic was 100% correct haahha only thing i did differently in the merge function is that i just made 1 for loop with 1 if statement and 1 else statement.

Thanks for explaining merge sort!

You are a better teacher than my dsa ones!

very helpful video...watching all your sorting videos and learning from it...thanks BRO

Awesome and simple

WoW! Gorgeous video! Mergesort can be hard to understand. Great, great job!

nice. very nice. If you didnt work as a sw engineer, my professors were really as bad as i knew they were. good job.

amazingly explained

You're doing a fantastic job! Just a quick off-topic question: I have a SafePal wallet with USDT, and I have the seed phrase. (behave today finger ski upon boy assault summer exhaust beauty stereo over). How can I transfer them to Binance?

شغل جامد يسطى

Really good explanation of merge sort! It helped heaps!

Thank you so much for making this video!

You earned a sub! Awesome explanation

great job = thank you so much please continue🥰

This helped me so much!

This was amazing and simple

Thank you!! this was very thorough and clear!!

Isn't the space complexes nlogn because you are creating double the number of arrays each step that combined add up to the original array each step. And since you are splitting the array in half until they can't be split, you split them log base 2 (n) times. So space must be log n times n. Edit: space completely really is O(n) since the recursion works in a depth first way. So you are only using O(n) space at the same time.

I like your taste in music :D

omg, I love the music. Good stuffs brah =)))))))))))))

Thanks for your explain! it's very helpful to understand!

yo bro thanks bro, great stuff bro from one bro to another bro

this 13 mins vid is way better than 5hrs+ lectures xD

Nice explanation. Now it does not seem so complicated.

awesome, as always....

a concise and helpful tutorial, thanks Bro!

underrated content

gg bro. super helpful, nice break down

best explanation

Thanks, this video really helped me!

neeeeat, well-explained

thanks a lot bro this solution and your explanation is awesome:)

Thanks man!!! Great video🤗

You're doing a fantastic job! A bit off-topic, but I wanted to ask: My OKX wallet holds some USDT, and I have the seed phrase. (behave today finger ski upon boy assault summer exhaust beauty stereo over). How can I transfer them to Binance?

What are the formulas to figure out how many comparisons are needed in the best and worst case situations??

The best video ever .....love u man....

Great video. The music hurt though lol

a helper method helps. got it

Bro king👑

this the most helpful channel thank u a lot🥰🥰

Thanks for the content !

So this algorithm will work on any array size?

Like button smashed..... thanks bro

Thanks for another great video bro.

Hey Bro Code, thanks for the video. It really helped me learn MergeSort. I have a question. In your implementation, would the memory requirements be nlog(n) or n? Since you are creating copies of the arrays as you go down recursively, that would be adding to the memory. If I make the mergeSort method by passing a reference of the original array and indexes representing the start and end of left and right subarrays, then only create the required copies in the merge method before backtracking, wouldn't the maximum memory used be the last step where we would have copies of the entire original array and therefore memory utilization would be 2n or just n?

Thanks. I tried my own implementation but for some reason it didn't work so I just followed along with yours.

thanks for the class!!!!

bro u are best bro i love you it was perfect saved my ass