I realize the featured example is not the most optimal Quicksort implementation. I doesn't even handle duplicates. Indeed this variant was chosen primarely because of its aesthetics.
While I'd like to keep the mission of this project to "illustrating the basic mechanics of algorithms as elegantly as possible", I realize this can be a) annoying for people who understand the specifics in depth, and b) not enough (or confusing) for people just picking this up. Which is why I'm thinking of creating an info page for each algorithm to:
Outline the limitations of the featured version
List a number of possible improvements (e.g. pivot strategies)
Link to external resources for complete examples & docs
Mkay, tell me more...
A few actions to take
[x] Improve docs on project mission, constraints and biases (e.g. brevity vs optimal solution) to avoid creating wrong expectations
What's up?
From HN thread:
Mkay, tell me more...
A few actions to take