@article{hoare1962quicksort,
  abstract = {A description is given of a new method of sorting in the random-access store of a computer. The method compares very favourably with other known methods in speed, in economy of storage, and in ease of programming. Certain refinements of the method, which may be useful in the optimization of inner loops, are described in the second part of the paper. },
  author = {Hoare, C. A. R.},
  interhash = {90334d822bec08f9800dd538623e34f0},
  intrahash = {fa584e8539f5c8d6dbf7bd8cab4578d4},
  journal = {The Computer Journal},
  number = 1,
  pages = {10-16},
  title = {Quicksort},
  url = {http://comjnl.oxfordjournals.org/content/5/1/10},
  volume = 5,
  year = 1962
}

@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
}