Almost 3h spent writing this code in Python using this video as a reference... At first, the will is to give up, once we succeed, there's this amazing feeling about programming. Thank you for your lessons, professor! Greetings from Brasil
does anyone know what he wrote at the end? "Out of place"?
6 лет назад+2
When we are merging the sorted values, we cannot put them into the original array, we need to make a new array of the size of the original array (lets call it a temp array), and put sorted values into it. Then we need to copy the sorted values from a temp array into the original array (so you can continue with recursive merging).
![Eminem - Temporary (feat. Skylar Grey) [Official Music Video]](http://i.ytimg.com/vi/ZaK9Wi5ho0o/mqdefault.jpg)
brilliant job, professor, thank you so much.
Almost 3h spent writing this code in Python using this video as a reference... At first, the will is to give up, once we succeed, there's this amazing feeling about programming. Thank you for your lessons, professor! Greetings from Brasil
The way you explain is really amazing
Best DS&A professor on RUclips.
This is an amazing explanation sir. Thank you so much.
These videos are amazing :)
Very helpful, thank you!
Thank you so much. Very easy to understand.
I love you Dr. Edwards
Thank you for the explanation.It's perfect.
Thank you for the awesome videos!
Best explanation existed so far.
thank you so much, professor!
2:26 - Nice
So irrelevant
Thank you so much for these videos!
Thank you for making it fun.
thank you sir
What's that you're writing on? Really great to learn
Excellent method of sorting. Let me try multi threading on it
thanks a lot sir
Jesteś zajebisty typie
1:04
Thanks sir
sir which are the steps? I mean when the question give us said that right just steps so which one steps?
what if the initial list or array is odd?
it will take integer part, example : consider your start is 1 and end is 6 and if you find middle it will be 1+6/2 = 7/2 = 3.5 = 3.
does anyone know what he wrote at the end? "Out of place"?
When we are merging the sorted values, we cannot put them into the original array, we need to make a new array of the size of the original array (lets call it a temp array), and put sorted values into it. Then we need to copy the sorted values from a temp array into the original array (so you can continue with recursive merging).
what is he writing on??
he writing on your screen bro