Looking for an edge with the classic Quicksort algorithm
Conclusions
Is Quicksort my favorite algorithm? I am not sure. In any case, it is clear that an understanding of this algorithm is part of the mandatory repertoire of every professional software developer. Annoyingly, the classical implementation of the Quicksort algorithm obscures its elegant structure and thus also complicates its basic understanding.
Infos
- Quicksort: https://en.wikipedia.org/wiki/Quicksort
- Tony Hoare: https://en.wikipedia.org/wiki/Tony_Hoare
- Destructive Assignment: https://en.wikipedia.org/wiki/Assignment_(computer_science)
- std::partition: https://en.cppreference.com/w/cpp/algorithm/partition
- Microsoft's STL implementation: https://github.com/microsoft/STL
« Previous 1 2 3
Buy this article as PDF
Express-Checkout as PDF
Price $2.95
(incl. VAT)
(incl. VAT)