Learn Merge Sort in 13 minutes 🔪

[@BroCodez]

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

[@syllight9053]

Don't worry bro, I smashed the like button, plus I contacted the president to set a direct nuclear launch to the like and subscribe button as well!

[@BroCodez]

@@syllight9053 Thank you Syllight!

[@immortalbotyt1428]

I already did my big bro :D If we both belonged to only 1 family u would be my bigger bro :D

[@aditya_asundi]

3 weeks making this *AND THERE'S A DISLIKE????*

[@roysaka4475]

Hi bro plsae reques Tutorial Python AndroidHelper. Music, recorder, voice mix, microfon. Call phone, game, calculator, google voice recorder, and others.. 🙏🙏🙏🙏🙏🙏 Plsee

[@mayawhocodes3092]

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.

[@sancho608]

No. You are a bro now!!

[@fsxanas90]

why the karen vibe tho lmao

[@johndavis29209]

@@fsxanas90 Why anything

[@BigSmoke-r9w]

You are a bro! 👊

[@sabdullahtu-techandunboxin8131]

Fr

[@coltonbailey8873]

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

[@jorgemedina8497]

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

[@DopemonRoA]

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 !

[@raywei1701]

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

[@GamerOverThere]

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

[@2NormalHuman]

best most comprehensive explanation of Merge Sort. You know the content is going to be golden when you see a meme in the channel name

[@kingipra]

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

[@alirezabayat4337]

I wrote this code first time non-recursively, it was a DISASTER, but this is super easy! Thank you!

[@aadv1k]

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!

[@zyad6385]

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

[@Bromon655]

Recursive algorithms are the bane of my existence.

[@danielebbersmeyer5087]

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

[@Nootey33]

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.

[@docjp7427]

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

[@quantjet7718]

Wow you are one of the best KZbinrs to explain algorithms

[@nyasha_keith_matevengwe]

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

[@tsfgh9568]

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

[@nyankiku5863]

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

[@valioprea9796]

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 ?

[@paulodasilvasa9884]

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!!!

[@murnoth]

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

[@LizyAd]

Don't ever stop doing what you're doing. You're the GOAT

[@lingjosh6801]

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

[@nurulafsar3195]

Best explanation of merge sort so far!

[@alperenunuvar]

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

[@StrangerHaha76]

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

[@eniax]

Best merge sort tutorial I've seen, thank you

[@smokinginthefishroom]

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

[@NH-ij8dz]

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.

[@hannibalbianchi1466]

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

[@arturofuentes2230]

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

[@BrunoHenrique-oe5hb]

Bro, youre helping me through college. I appreciate it

[@tipster360]

The best merge sort explanation! Thank you so much.

[@Crystal-gs4gu]

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

[@sanskarsongara2592]

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

[@daviduntalan]

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

[@nicholasgates9391]

Ive never learned a concept so fast, thank you so much!

[@РашидМирзе]

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

[@esmailalmoshki]

شغل جامد يسطى

[@charalamposkatsoukis8694]

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

[@radicalsaled5756]

nice job, simple explanation of a long algorithm

[@bhumikajoshi6966]

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

[@JazzInATinCan]

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

[@rizzbod]

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

[@DruzeJosipTito]

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

[@juanivillanueva7873]

You are a better teacher than my dsa ones!

[@ianvensonbolanio3327]

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

[@aorusaki]

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

[@toxiclucien8168]

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

[@wmd5645]

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

[@sanjusaju4049]

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

[@doogiehowser1124]

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

[@hoanganhnguyen3438]

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

[@kennysoyoye493]

this really helped me understand merge sort. thanksss a lot

[@vansh9857]

You earned a sub! Awesome explanation

[@09FT9]

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

[@Yuschova]

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

[@MrWardo2009]

Thank you so much for making this video!

[@mohtasimbillah6560]

Really good explanation of merge sort! It helped heaps!

[@cadmium4113]

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

[@Marzex1x]

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.

[@rejected4760]

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.

[@neophilosophy1764]

Nice. Thanks for the video!

[@greeneye360k]

best explanation

[@MeditateRelaxEtcetera]

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

[@sprinklepancake]

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

[@sallaklamhayyen9876]

great job = thank you so much please continue🥰

[@engineeringmania9125]

Thanks man!!! Great video🤗

[@vinayshenoy9896]

very well explained, Thank you very much

[@Zashy_P]

THANK YOU SO MUCH U EXPLAINED IT SO WELL :) :) :) :)

[@harshitvarshney3993]

underrated content

[@EzraSchroeder]

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

[@davidcastrocarvajal6850]

Thank you very much for this video!

[@DJSaez-ll8or]

Really helpful video, thank you!

[@Matthew_080]

Thanks for explaining merge sort!

[@ashutoshswain4050]

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

[@Jimmy403.J]

Great video very informative

[@jamongx1]

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

[@Gladio28]

Very helpful, wish you the best

[@starwyvern010]

This helped me so much!

[@taido4883]

Thank you Bro! However, I still have trouble understanding the recursive part mergeSort(leftArray); mergeSort(rightArray); merge(leftArray, rightArray, array); The mergeSort function continuously divides an array into 2 halves. By the time we call merge(leftArray, rightArray, array), is array still the original array? However, leftArray and rightArray are no longer half of the original array because we call mergeSort(leftArray) and mergeSort(rightArray) before calling merge(leftArray, rightArray, array).

[@joimeecajandab1438]

me tooo.. this breaks my brain

[@Snowmanver2]

a concise and helpful tutorial, thanks Bro!

[@MikeSieko17]

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

[@AN-rz7bs]

Thanks, this video really helped me!

[@johnxina7496]

amazingly explained

[@sharifoko]

Well explained, thanks.

[@quantumtea7394]

Thank you for your amazing videos!!!❤️❤️❤️

[@dangerbirb4981]

I like your taste in music :D

[@sahu_SuMiT]

awesome, as always....

[@JoelRevzen1]

nice explanation, thanks👍

[@mike-fl9xi]

gg bro. super helpful, nice break down

[@zulbijadhalid]

you know! you make my day always

[@bryanswiger5888]

Like button smashed..... thanks bro

[@nasirbashirov]

Bro king👑

[@alaasefa1118]

this the most helpful channel thank u a lot🥰🥰

[@josy7]

Thanks for the content !

[@ernestselman3955]

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?

[@brandonkruger9040]

Thanks for another great video bro.