I enjoyed the video immensely, by the way!
You may also consider looking into two more, both of which are among the fastest known sorting algorithms in existence.
Thank you, I'll look into them! 😊👍
It's encouraging to see you summarize what learn from courses, at the same time others can learn from you as well. Keep doing it 👍🏻
I didn't get avoid overflow part
To prevent integer overflow for large numbers which could end up being too big to fit the integer's storage space.
Aha, I see
So we get the difference first and divide it by 2 then add it to the start.
instead of adding the start and the end.
But why we didn't do the same with the js example ?!
To highlight both possibilities? You don't always have to worry about overflow; When you do, it's nice to know there's a simple solution. These are just notes.
Show them this video as starter :)
We're a place where coders share, stay up-to-date and grow their careers.
We strive for transparency and don't collect excess data.