thank you very much sir, surfed the entire net for satisfaction but the high tide was here, thanks for the great surf-time got to love tides more with your vid.
Genuinely the best explination of the merge sort recursive function I've found (and believe me I've been watching a lot of them). Really appreciate the thorough explanation with ca;ll stack visualisation
This is by far the most detailed video on MergeSort on the NET, a lot of other videos do not show the sequence , which is very important , Thanks a lot man .
Glad you appreciate it. Merge sort is easy to understand at a high level, but being able to implement it requires a deeper understanding. Thanks for the comment. :)KD
I kept looking for this for like 3 days. I could confidently say that you are the only resource that shows how the 2 recursive functions back to back work in the stack. Thank you
It's definitely a concept that isn't usually explained very well. This should also help you to understand recursion and, when it comes to it, Big O time and space complexity. Thanks for the lovely comment. :)KD
Thank you! Finally found a video of how recursive merge sort works inside the computer. I was wrapping around my head trying to trace the recursion. And this video really helps.
Fantastic video, thank you! Using the call stack makes the recursive process so much more intuitive. Without this, the control flow makes little sense and it becomes about a lot of hand-waving. Very well done!
Thanks so much for this! I was looking for an explanation using the call stack to see the order in which the functions will get fired and this demo was superb!
This is the most well detailed and thoroughly explained version of Merge Sort I have come across. I had issues understanding the recursive calls but you have broken them down so easily and step by step that anyone could follow along. Thank you so much! You're the bomb!
This is the best explanation out there! I implemented this in C# and debugged with the call stack. Each recursive call creates it's own set of local variables, and this makes so much more sense now. Thank you Kevin =)
This explanation is so clear, that halfway through the video I paused and wrote a working implementation in C#. Thank you! Best video on the subject so far.
Fantastic explanation! When I think of recursion problems, it's difficult for me to keep track of the stack. I find it necessary to draw notes and keep a copy of the stack
Recursion was a tricky concept for me when I first met it. Thinking about recursive code in terms of the execution stack definitely helped me. Some lucky people can just 'see' it. :)KD
what is meant by Sub.. is it the same as Function. because i want to write the complete pseudocode for this. to me it looks like i have to include these 3 functions in the same program. but the dividing part is a sub in this, not a function. what is the reason behind this?
Agreed. I urge my students to try to implement algorithms with code, if they want to truly understand them. Oddly, in the UK, we teach the principle of the merge sort to 14 year old GCSE students, which I think is premature. Even the most able A Level students struggle to implement it. If nothing else, they come to appreciate it's beauty, and the genius of John Von Neumann :)KD
thank you very much sir, surfed the entire net for satisfaction but the high tide was here, thanks for the great surf-time got to love tides more with your vid.
Genuinely the best explination of the merge sort recursive function I've found (and believe me I've been watching a lot of them). Really appreciate the thorough explanation with ca;ll stack visualisation
Man that was superb
if only we had teachers like you
the world can go next level quickly :)
thanks for the video
This is by far the most detailed video on MergeSort on the NET, a lot of other videos do not show the sequence , which is very important , Thanks a lot man .
Glad you appreciate it. Merge sort is easy to understand at a high level, but being able to implement it requires a deeper understanding. Thanks for the comment. :)KD
I kept looking for this for like 3 days. I could confidently say that you are the only resource that shows how the 2 recursive functions back to back work in the stack. Thank you
It's definitely a concept that isn't usually explained very well. This should also help you to understand recursion and, when it comes to it, Big O time and space complexity. Thanks for the lovely comment. :)KD
Thank you! Finally found a video of how recursive merge sort works inside the computer. I was wrapping around my head trying to trace the recursion. And this video really helps.
Fantastic video, thank you! Using the call stack makes the recursive process so much more intuitive. Without this, the control flow makes little sense and it becomes about a lot of hand-waving. Very well done!
Thanks so much for this! I was looking for an explanation using the call stack to see the order in which the functions will get fired and this demo was superb!
You're very welcome. :)KD
Wonderful tutorial. Explanation is so descriptive and easy to understand. Couldn't find anything like this somewhere else. I became your fan Kevin.
This is the most well detailed and thoroughly explained version of Merge Sort I have come across.
I had issues understanding the recursive calls but you have broken them down so easily and step by step that anyone could follow along.
Thank you so much!
You're the bomb!
very well explained, the call stack even have the same color with the list that function is handling ,very detailed .Thank you !
You're most welcome. And thank you :)KD
I was trying to understand how recursion works in Merge sort. Glad that I found this video, thanks a lot!!
I'm glad to have helped :)KD
This is the best explanation out there! I implemented this in C# and debugged with the call stack. Each recursive call creates it's own set of local variables, and this makes so much more sense now. Thank you Kevin =)
You are very welcome. Glad to help. :)KD
Excellent video!! The recursion call stack visualization is superb!
You're very welcome. Thank you :)KD
This is the best playlist for merge sort. Thank you so much for these wonderful explanations : )
You are most welcome - glad to help :)KD
This explanation is so clear, that halfway through the video I paused and wrote a working implementation in C#. Thank you! Best video on the subject so far.
It's great to hear you found it useful. :)
Fantastic explanation! When I think of recursion problems, it's difficult for me to keep track of the stack. I find it necessary to draw notes and keep a copy of the stack
Recursion was a tricky concept for me when I first met it. Thinking about recursive code in terms of the execution stack definitely helped me. Some lucky people can just 'see' it. :)KD
Wow, Great video! The use of the call stack to show control flow is what did it for me!
Yes, that was the light bulb moment for me too. :)KD
thank you so much for this video, best video on youtube on this topic, really detailed explanation. loved it
I don't know why there aren't much likes,
But seriously man this is the best explanation of merge sort
hats off :)...
Tnx. :)
You're very kind :)
Best Explanation for recursive function, Thank You Very Much.
Happy to help. Thanks for commenting :)KD
Guys I finally understand it Nice video the call stack idea is genius
That's when it clicked for me too. :)KD
i think i will need to watch this 10 times but superb explanation thanks
Thank you. It can take a while to fully understand this. Take your time with it. :)KD
This explanation is fantastic, great job Kevin :)
:)
thanks so much for this upload. you are a savior!
WOW....... I really love this. You really gave me what i want.
bestest bestest bestest tutorial i have ever seen.
good one and nicely explained, i was exactly looking something like this.
You're welcome. Thanks for the feedback.
Wonderful! Thanks, sir
felt like reading a novel :P
Thanks for this great video!
You're most welcome. :)KD
Very good tutorial.
Thanks. :)KD
Great explanation.
Tnx
what is meant by Sub.. is it the same as Function. because i want to write the complete pseudocode for this. to me it looks like i have to include these 3 functions in the same program. but the dividing part is a sub in this, not a function. what is the reason behind this?
Sub can be read as 'procedure' . It is short for Sub Procedure in VB. (Spot the VB programmer!)
ah ok thanks mate. i got a little confused there
Thank you!
Awesome!
Thank you :)KD
I always was confused why people think "sorting algos" are easy... sure the idea of them are easy but implementation haha.. that's another story!
Agreed. I urge my students to try to implement algorithms with code, if they want to truly understand them. Oddly, in the UK, we teach the principle of the merge sort to 14 year old GCSE students, which I think is premature. Even the most able A Level students struggle to implement it. If nothing else, they come to appreciate it's beauty, and the genius of John Von Neumann :)KD
source code pls