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
@syllight90533 жыл бұрын
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!
@BroCodez3 жыл бұрын
@@syllight9053 Thank you Syllight!
@immortalbotyt14283 жыл бұрын
I already did my big bro :D If we both belonged to only 1 family u would be my bigger bro :D
@aditya_asundi3 жыл бұрын
3 weeks making this *AND THERE'S A DISLIKE????*
@roysaka44753 жыл бұрын
Hi bro plsae reques Tutorial Python AndroidHelper. Music, recorder, voice mix, microfon. Call phone, game, calculator, google voice recorder, and others.. 🙏🙏🙏🙏🙏🙏 Plsee
@mayawhocodes30922 жыл бұрын
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!!
@fsxanas905 ай бұрын
why the karen vibe tho lmao
@johndavis292095 ай бұрын
@@fsxanas90 Why anything
@BigSmoke-r9w3 ай бұрын
You are a bro! 👊
@sabdullahtu-techandunboxin81312 ай бұрын
Fr
@coltonbailey88733 жыл бұрын
You are single-handedly teaching me programming/computer science. Thank you. Never change your teaching structure, because this method works really well.
@LizyAd16 күн бұрын
Don't ever stop doing what you're doing. You're the GOAT
@Jathamus2 жыл бұрын
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 !
@jorgemedina84975 ай бұрын
This is the best video I found on all youtube which explains Merge Sort properly. This video is the definition of Quality Content.
@raywei1701 Жыл бұрын
So clear. my professor did not have enough time to go over this in class. Now I understand everything about merge sort.
@kingipra Жыл бұрын
Best explanation I've seen so far. The rundown at the beginning really helps. Thank you
@alirezabayat433715 күн бұрын
I wrote this code first time non-recursively, it was a DISASTER, but this is super easy! Thank you!
@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
@sanskarsongara25923 жыл бұрын
Idk you sounds more confident in recent new videos, keep going homie you still gotta reach more people👍
@nyasha_keith_matevengwe2 жыл бұрын
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
@danielebbersmeyer50877 ай бұрын
Probably the best video i've seen so far to explain Mergesort, i think i finally got it!
@tsfgh9568Ай бұрын
We’re passing Oneil’s class with this one 🗣️🗣️🔥
@aadv1k8 ай бұрын
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!
@nicholasgates939117 күн бұрын
Ive never learned a concept so fast, thank you so much!
@nyankiku5863 Жыл бұрын
You made mergeSort look so simple and easy, thank you so much!
@Nootey332 ай бұрын
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.
@quantjet771810 ай бұрын
Wow you are one of the best KZbinrs to explain algorithms
@docjp742710 ай бұрын
You are the best Bro I never had. 2 years have gone by, but this is still amazing.
@Bromon6557 ай бұрын
Recursive algorithms are the bane of my existence.
@paulodasilvasa988411 ай бұрын
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!!!
@valioprea97962 жыл бұрын
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 ?
@eniax Жыл бұрын
Best merge sort tutorial I've seen, thank you
@alperenunuvarАй бұрын
this video is one of the best one that I've ever watched
@zyad638510 ай бұрын
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
@daviduntalanАй бұрын
this helps me understand how the algorithm works, thank you bro for this detailed explanation. ^_^
@РашидМирзе Жыл бұрын
Good job! It is really easy to understand the algorithm with this video, thank you
@murnoth2 жыл бұрын
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
@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.
@BrunoHenrique-oe5hb3 ай бұрын
Bro, youre helping me through college. I appreciate it
@nurulafsar3195 Жыл бұрын
Best explanation of merge sort so far!
@arturofuentes22306 ай бұрын
Great video man, I understood everything so quickly, thank you so much and keep coding bro
@hannibalbianchi14663 жыл бұрын
No words can explain my appreciation Thank you, sir 🏆🏆🏆🏆
@lingjosh68013 жыл бұрын
Clearly explanation and demonstration with merge sort, great work!!! Can,t wait for more CS videos.
@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
@aorusaki Жыл бұрын
Needed this for my interview :))) thank you!
@radicalsaled5756 Жыл бұрын
nice job, simple explanation of a long algorithm
@bhumikajoshi69663 жыл бұрын
it'd be really helpful if you continue this playlist!!! thanks in advance
@DruzeJosipTito Жыл бұрын
You just made my computer science assignment a whole lot easier lol. Thank you.
@JazzInATinCan Жыл бұрын
Good video, not too long, not too short. Great job.
@charalamposkatsoukis8694 Жыл бұрын
top content as always. No one more understandable than Bro! (I hope you doin good on your break!!!)
@rizzbod Жыл бұрын
Thanks man! , because of you , i can skip the tough work of learning, hehe, and straight jump into implementing algorithms
@juanivillanueva7873 Жыл бұрын
You are a better teacher than my dsa ones!
@vansh9857 Жыл бұрын
You earned a sub! Awesome explanation
@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
@doogiehowser1124 Жыл бұрын
Wow! this is a good tutorial. Thank you very much for taking the time to put it together! Well Done!
@kennysoyoye4933 ай бұрын
this really helped me understand merge sort. thanksss a lot
@cadmium41133 жыл бұрын
Started your Java playlist love your tricks to teach... Appreciate from another fellow BRO.
@esmailalmoshki Жыл бұрын
شغل جامد يسطى
@NH-ij8dz7 ай бұрын
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.
@ianvensonbolanio3327 Жыл бұрын
Thankyouuuuusomuch, your video really helps our group "MEMANG".
@09FT92 жыл бұрын
If you ever publish a book, I'd be the first one to buy it. Excellent work, Bro. 🙏
@toxiclucien81682 жыл бұрын
very helpful video...watching all your sorting videos and learning from it...thanks BRO
@Gladio2824 күн бұрын
Very helpful, wish you the best
@mohtasimbillah65602 жыл бұрын
Really good explanation of merge sort! It helped heaps!
@sprinklepancake Жыл бұрын
Thank you!! this was very thorough and clear!!
@wmd56452 жыл бұрын
nice. very nice. If you didnt work as a sw engineer, my professors were really as bad as i knew they were. good job.
@MrWardo2009 Жыл бұрын
Thank you so much for making this video!
@vinayshenoy98964 ай бұрын
very well explained, Thank you very much
@EzraSchroeder2 жыл бұрын
WoW! Gorgeous video! Mergesort can be hard to understand. Great, great job!
@MeditateRelaxEtcetera7 ай бұрын
That's terrific! I'm working my way thru your videos. Wish I found your channel earlier.
@Matthew_0809 ай бұрын
Thanks for explaining merge sort!
@sanjusaju4049 Жыл бұрын
The best video ever .....love u man....
@dangerbirb49815 ай бұрын
I like your taste in music :D
@Jimmy403.J23 күн бұрын
Great video very informative
@harshitvarshney3993Ай бұрын
underrated content
@Snowmanver22 жыл бұрын
a concise and helpful tutorial, thanks Bro!
@starwyvern0103 ай бұрын
This helped me so much!
@Yuschova Жыл бұрын
this 13 mins vid is way better than 5hrs+ lectures xD
@neophilosophy17646 ай бұрын
Nice. Thanks for the video!
@JoelRevzen110 күн бұрын
nice explanation, thanks👍
@johnxina74968 ай бұрын
amazingly explained
@DJSaez-ll8or6 ай бұрын
Really helpful video, thank you!
@hoanganhnguyen34387 ай бұрын
omg, I love the music. Good stuffs brah =)))))))))))))
@davidcastrocarvajal685019 күн бұрын
Thank you very much for this video!
@sallaklamhayyen98767 ай бұрын
great job = thank you so much please continue🥰
@greeneye360k4 ай бұрын
best explanation
@MuschikLykinsАй бұрын
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?
@jamongx1 Жыл бұрын
Thanks for your explain! it's very helpful to understand!
@AN-rz7bs11 ай бұрын
Thanks, this video really helped me!
@engineeringmania91252 жыл бұрын
Thanks man!!! Great video🤗
@ashutoshswain40502 жыл бұрын
thanks a lot bro this solution and your explanation is awesome:)
@alaasefa1118 Жыл бұрын
this the most helpful channel thank u a lot🥰🥰
@MikeSieko1710 ай бұрын
yo bro thanks bro, great stuff bro from one bro to another bro
@jacksonogles314728 күн бұрын
liked and subscribed. great video I can tell. man I'm so new to this, gonna have to practice. I can hardly follow 😂
@Assassin2743 ай бұрын
This was amazing and simple
@sahu_SuMiT6 ай бұрын
awesome, as always....
@mike-fl9xi Жыл бұрын
gg bro. super helpful, nice break down
@Ray101SPAS Жыл бұрын
Nice explanation. Now it does not seem so complicated.
@rejected47602 ай бұрын
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.
@bryanswiger5888 Жыл бұрын
Like button smashed..... thanks bro
@ernestselman395511 ай бұрын
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?
@brandonkruger90403 жыл бұрын
Thanks for another great video bro.
@eugenezuev73492 ай бұрын
neeeeat, well-explained
@josy711 ай бұрын
Thanks for the content !
@lenicholstech4 ай бұрын
Great video. The music hurt though lol
@one111won Жыл бұрын
legendary explanation
@adamloepker80573 ай бұрын
What are the formulas to figure out how many comparisons are needed in the best and worst case situations??