Merge Sort step by step walkthrough (Recursion)

[@goutham_gsm]

I have seen many videos to understand how recursion is going in this merge sort. This is the first and best video to give clear cut clarity in this concept. Thank you so much!

[@motoduster5856]

Nice you explained the control flow of the recursion which many other videos don't even mention 👍

[@mordernmonk194]

right

[@plazaorly5463]

i was stuck in this sorting algorithm and hopeless how exactly recursion works in this algorithm, not until i saw this video, thanks man

[@陈瀚龙]

I've struggled with several tutorials before this. You're the first to actually explain it clearly. And you used Java. Way to go!

[@陈瀚龙]

Please, more like these for, beginners.

[@ryanrussell4071]

You are a blessing sir. Bless your soul. This thing had me confused for hours and you broke it all down in 7 minutes. You are amazing.

[@pawanagarwal6960]

Thanks, for this vedio, I was also facing the problem on how the recursion thing was working....I was searching for an explanation from the last 3-4 days ....not found any.... Now finally my search ends.. Really it helped me a lotttt... Thanks for the vedio

[@AbuSayed-qe1hr]

best explanation of mergesort on the internet

[@pragyasingh6385]

Really....Ur the first video which has shown me the flow of control in recursion process.....thank u so much!...

[@rocknikhil5905]

Recursion part in merge sort always confused me and no other video explained the flow. Thanks to you now I finally understand it.

[@pradeepramola2295]

Thank you finally understood how recursion really works in merge sort internally!

[@Rkbittu]

Thank You For giving such a clear cut process I was really confused before how the recursion was going on

[@olaberglund9615]

THIS. YES. EXACTLY. As Luis said, you explained the recursion's flow. Thank you!

[@AK09037]

A lot of people owe you for this amazing explanation

[@manvir4864]

Just like the rest of the comments, this video is far best for a beginner because it is clear on the multiple recursion and it goes line by line and doesn't go off the road. This video will continue to help students in future years, that is for sure..

[@emmaguo619]

The best explanation for the merge sort.

[@sharleenclement5751]

I was struggling to understand the recursion part. Thank you so much for this!

[@breakdancerQ]

Thanks I was able to finally understand this sort! The lack of knowledge of flow really messed me up but this step by step real code video did it!!

[@Fifi-pg5rp]

this video genuinely saved my life god bless

[@jaelinmccreary9217]

Just like everyone else here, this really helped me understand the flow! Thank you!

[@ShivamSingh-pu9pi]

The visual representation of recursion going on behind merge sort is correctly shown here. In other videos its just like divide until you reach single item and combine one by one but there is no mentions that 1st left half is broken into single item then it will call the right_half and on and on . Well this helped me a lot to verify about the recursion in Merge sort. Thanks bro for such insightful video.!!

[@AbhishekSingh-xq4cu]

That was the only thing in merge sorting where I was sticking into you made it very clear to me man. Thank you

[@eagerassaultixopi4558]

Damn you cleared my concepts like no one else before, definitely recommending this to everyone +1 sub

[@TheCantoneseGuyLucas]

Best explanation of merge sort

[@mike220_8]

Awesome job! Thank you for breaking down the recursive steps You've presented such a clear explanation of how they work in merge sort. Nice teaching!!

[@pranavrajeev8976]

OH YEAHH BABYY!! I watched many videos to understand how merge sort works ...but i never understood... , NOW I COMPLETELY UNDERSTAND MERGE SORT.....THAT RECURSION THING GOT ME GOING CRAZYY BROO.... ONeilCode YOU JUST MADE MY DAY BETTER.... AND GUESS WATT?? YOU HAVE GOT A NEW SUBSCRIBER :)

[@emilwallin1176]

thank you for your effort to try to make me and others understand, appreciate it

[@williamc.8668]

Dude thank you so much, having this algorithm illustrated really help me tie every thing together!

[@salmonmonkey24]

Excellent explanation of the inner workings of merge sort! Just what I was looking for. Thank you!

[@sononsoft5253]

One of the best explanation out there!

[@parikshit475]

wow sir, u showed us the exact recursion part i was in need of,which no other video showed.

[@stevenstonie8252]

Hardest point of the algorithm and you fucking nailed it. thanks for the explanation.

[@lover1301]

I got stuck with merge sort fews day and you helped me

[@miguelunch4]

I really needed a step by step guide with visual aid to understand this. Thanks a lot for taking your time to do it, a job well done!

[@adarshgadekar3957]

This is the best one which I have was searching for weeks .... u nailed it buddy the concept was crystal clear... great job

[@akashkhunt4191]

Believe me! best explanation on internet.. Thank you @Stephen

[@gaganhegde6805]

Finally a video explaining the essentials of merge sort.Thank you.

[@softMediaWox]

Mate. You bloody saved my life. Thank you!

[@ashishverma3927]

Nicely done sir. Finally i got where i was going wrong and indeed it is step by step walkthrough. Thanks..much appreciated..!!

[@NikhilSharma-rn1cd]

Thanks for the control flow of recursion

[@tinyu1804]

nice explanation ! thx you soooo much for my mid exam

[@soumyadeeproy9638]

This was the thing I was looking for,for quite a long time.Thanks

[@shahrozkhan1078]

Thanks man.You made many life easy.May God bless you

[@abdulrahmanalamoudi5397]

Thank you for this video. It helped me a lot in the midterm exam ❤️

[@henriquelopesnobrega1453]

This video helped me. Thanks! I had understood the idea behind the algorithm but I was struggling to understand the flow of the recursion. Thank you =)

[@xDFism]

Thank you very much I finally understood how it actually traverses

[@saswatsamantaray5070]

Thank you so much bro, by explaining the recursion you really helped me .

[@ucnguyen-jq4mh]

best explanation ever thanks so much

[@DineshKumar-lq2ck]

Very nice analysis explanations

[@nottomention]

Nice man! You've explained quite nicely.

[@shrivatsarao9481]

Helped me a lot. Thank u sir

[@salahabdeljalil8591]

thank you very much your explain it very simple and very clear thank you again

[@rodrimarchese]

best mergesort explanation video on yt

[@poggly]

awesome! the most comprehensive explanation i've found

[@fantasticghosts7366]

An intuitive explaination.

[@Tnvrahmed98]

This was the best explanation i found on YT. Thanks alot sir. :)

[@abhishaiwinston9794]

Awesome!

[@spiritualgyanhindi2681]

Really i got it this time! Finally at here...

[@xSAxHellboy1]

Really good explanation, thank you

[@divyanshuyadav5524]

Best explanation ❤️❤️❤️❤️❤️🙏

[@BagsyBag]

I was confused about why the second while-loop only dealt with the elements in the left sub-array and not the elements in the right sub-array. The way I understand it is: - The second while-loop is needed in case "helper position-j" reached the end of the right sub-array in the first while-loop. - Another while-loop is not needed if "helper position-i" reached the end of the left sub-array in the first while-loop because: 1. The right sub-array's remaining elements are guaranteed to be of higher value than the elements in the sorted portion of "numbers-array". 2. Each of the two sub-arrays is by itself already sorted. - This means that the right sub-array's remaining elements are all of higher value AND already sorted. - The remaining elements in "numbers-array" are the same as in "helper-array" since that is just a copy, so we are done. Maybe it's just me that got confused about that but there you go. I think that's how it works...

[@OhhOmni]

better than hackerrank video, my opinion

[@aayushsharma9817]

best vedio on mergesort!!!!!

[@tylerhansen4566]

The is the best explanation and code sample I've been able to find so far. Thanks for the help!

[@ycb7437]

You are just amazing, Thank you !

[@vtrh2]

I think you are missing a while loop at at the end of the merge function. you also need to copy what is left on the right side of the array into the target array: while (j

[@____________7035]

this is also what i was wondering. he should have at least included a case where the right side had leftovers and included the necessary code to catch them. this video explains very well but it is lacking that one small piece to make it 100%

[@mostafayakout9120]

YOU ARE THE BEST

[@ronihossain7428]

Thankyou Sir....

[@Mythovedic]

Perfect !Really helpful

[@PrashantKumar-gg5qd]

thanks for explaining control flow

[@kMEAmartyaPrabhakar]

Thank you sir for the explanation. It cleared almost all my doubts.

[@shivammaniya2962]

thanks you so much sir .........you made it too easy

[@sanchitbhatnagar7283]

Hey, can someone help me at 5:30, i wondering if the recursive mergesort divides until low

[@Suni777]

yours explanation with program nice sir thank you very much

[@_LikithaS]

Tq so much.Great explanation🤩

[@vishwanathchintala2000]

man you arraymazing

[@phazon100]

Struggling to keep track of recursion from 5:00 onwards. From 2 to 3, to 2 to 2.

[@vuanhkhoa9715]

You are my hero

[@infi3521]

you fucking blew my mind! AMAZING!!

[@oliverrochester591]

In the first step you identified that the array's smallest value is 0 and the arrays largest value is 6. I understand that you calculated (0 + 6) / 2 to get the middle of 3. but what if you don't know the smallest or largest value in the array to begin with?

[@____________7035]

great explanation but at 6:16 the graphic is confusing. the 3 wouldn't appear 3 times logically; it would lose the first time it is called on the level of mergesort(4, 6) and once it loses, it would get merged with the 2 and 5. it wouldn't lose 3 times to get to the same level as the 2 and 5, it would lose once and the recursive call would finish for mergesort(4, 6) and they would get merged.

[@tasdyquesyed1004]

that final while loop that checks if i

[@ReddiSathvik]

Man, thank you so much

[@ayushmishra927]

u are absolutely awesome!!!!!!!

[@ThemisTheotokatos]

Hello! where do you define helper[] and numbers[] ? are they global array variables?

[@udayptp]

Which software you used to make this video, specially i liked your animation work

[@learnfoodies3608]

Thank you so much sir for these great explination

[@sheumhossain5000]

really good. i also request to make some video on recursion with 2/3 recursive function.like in merge sort have 2 recursive function, i am in trouble with this recursion.

[@justinmontgomery9526]

2:41 merve on to the merge call lmao Great video! Thank you!

[@jyotsnavootla2138]

SAVIOR! THANK YOU SO MUCH!

[@fantasticghosts7366]

Please explain the recursion of Tower of Hanoi program.

[@rohanjain4238]

i cant thank you for this vedio man keep it up

[@shirishherwade6680]

If you are searching/liking this video means you came here for recursion and not for merge sort. As you already understood the algorithm but bit confused about how recursion calling happening.

[@chunheilee6340]

very good explanation which deserves my thumb up :P thank you so much

[@ratmouse088]

great video

[@rapetimohan8536]

Thanks a lot sir

[@ssk191998]

Comments really do save time .

[@chessmaster5207]

Awesome

[@muhammadarslanbhatti2139]

it would be helpful if you could label the arrays

[@mikemike7991]

what I to say is There may be a little mistake in author's code,In author's demo, the left array length is greater than right array length when merging the two arrays,but what if the left array length is smaller than right array length? so in this case,You have to add a while loop to copy the rest value in the right array into helper array. I don't know what I say is right or wrong?