@article{sedgewick1978implementing, abstract = {This paper is a practical study of how to implement the Quicksort sorting algorithm and its best variants on real computers, including how to apply various code optimization techniques. A detailed implementation combining the most effective improvements to Quicksort is given, along with a discussion of how to implement it in assembly language. Analytic results describing the performance of the programs are summarized. A variety of special situations are considered from a practical standpoint to illustrate Quicksort's wide applicability as an internal sorting method which requires negligible extra storage.}, author = {Sedgewick, Robert}, interhash = {9a4a22f5ef011caa82c52462824cf636}, intrahash = {a7a341c1a2f1f3af42a605010a204cfa}, journal = {Communications of the ACM}, month = oct, number = 10, pages = {847-857}, publisher = {ACM}, title = {Implementing quicksort programs}, url = {http://dl.acm.org/citation.cfm?id=359631}, volume = 21, year = 1978 }