re: Exponentially Easy Selection Sort VIEW POST


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( N2 ) is quadratic, not exponential (the latter would be something like O( 2N ), 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 😊

Code of Conduct Report abuse