Remember when we first began our adventure into sorting algorithms last week, and how we learned about the multiple ways one can break down and cla...
For further actions, you may consider blocking this person and/or reporting abuse
Awesome explanation of selection sort! Especially love the handdrawn diagrams + notes as well as the explanation of O(n) complexities and why we care about it. In today's time where most of us hit array.sort() it's cool to take a step back and remember what is going on behind the scenes.
A great post, I like the way you explain it with a simple background and in a friendly, easy to read way.
Only one thing, a complexity of O( N^2 ) is quadratic, not exponential (the latter would be something like O( 2^N ), which is way worse).
Keep up the good work!
Great catch! That was a silly mistake on my part -- thanks for pointing that out. I just updated the post 😊
Great Post! Thank you.
BTW, are you using Rocketbook for your Notes?
Nope -- I handwrite them all and use CamScan to scan them.
Another great post!
Thank you!💕