@phdthesis{sedgewick1975quicksort,
  author = {Sedgewick, Robert},
  editor = {Report, Stanford Computer Science},
  interhash = {be68511cc820a4cd44e6ea468d87ac29},
  intrahash = {a1d537575ec9603cb9ca4d1bf2d59efb},
  month = may,
  school = {Stanford University},
  title = {Quicksort},
  year = 1975
}

@article{bentley1997algorithmsfor,
  author = {Bentley, Jon and Sedgewick, Robert},
  interhash = {028c510bc641375ca7e265671ce6193f},
  intrahash = {1b56c8c856ab7fddb7cccaa8554777dd},
  journal = {In Proc. 8th annual ACM-SIAM symposium on Discrete algorithms, },
  pages = {360-369 },
  title = {Fast algorithmsfor sorting and searching strings},
  year = 1997
}

@article{loeser1974performance,
  author = {Loeser, Rudolf},
  editor = {ACM, Comm.},
  interhash = {ab2a42aa68218853b31e8dc8e92fb0af},
  intrahash = {20983f69b636442355f18172fe8c0fc5},
  journal = {Comm. ACM},
  month = mar,
  pages = {143 – 152},
  title = {Some performance tests of :quicksort: and descendants},
  url = {http://dl.acm.org/citation.cfm?id=360860.360870},
  volume = 17,
  year = 1974
}

@article{sourabh2000robust,
  author = {Sourabh, Suman Kumar and Soubhik, Chakraborty},
  editor = {Structures, Computer Science Data Algorithms},
  interhash = {e9e92f0a610a9803d21dc7c568579e36},
  intrahash = {f99df70b03ce8a21199e43ee39831c47},
  journal = {Computer Science - Data Structures and Algorithms,Computer Science - Computational Complexity},
  title = {How robust is quicksort average complexity?},
  url = {https://arxiv.org/ftp/arxiv/papers/0811/0811.4376.pdf},
  year = 2000
}

@article{anchala2007statistical,
  author = {Anchala and Kumari and Soubhik and Chakraborty},
  editor = {MATHEMATICS, APPLIED COMPUTATION},
  interhash = {ef94db879b3faa6cb743eada2f55636f},
  intrahash = {4ca9153e6f94a5f314827a20e07ba36a},
  journal = {APPLIED MATHEMATICS AND COMPUTATION},
  title = {A statistical case study through insertion sort},
  url = {https://www.researchgate.net/publication/220557053_Software_complexity_A_statistical_case_study_through_insertion_sort},
  year = 2007
}

@article{sodhi2013enhanced,
  author = {Sodhi, Tarundeep Singh and Kaur, Surmeet and Kaur, Snehdeep},
  editor = {of Computer Applications, International Journal},
  interhash = {142e865d9500206af47bdf75db1ae55a},
  intrahash = {cc0da8913397ddabb7e5042d7d5e3a21},
  journal = {International Journal of Computer Applications },
  number = 21,
  title = {Enhanced Insertion Sort Algorithm},
  url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.278.6654&rep=rep1&type=pdf},
  volume = 64,
  year = 2013
}

@article{shell1959highspeed,
  author = {Shell, Donald L.},
  editor = {{ACM}, Commun.},
  interhash = {286bd9beb29d4f5d10d3215cd433323b},
  intrahash = {84483f51ab4e1a1ed375609468c92a07},
  title = {A High-Speed Sorting Procedure},
  url = {http://doi.acm.org/10.1145/368370.368387},
  year = 1959
}

@article{BCM06,
  author = {{Michael A. Bender, Martin Farach-Colton}, Miguel A. Mosteiro},
  editor = {Springer Science+Business Media, Inc.},
  interhash = {65f2663837a14db219d7342da39408f7},
  intrahash = {5c381a08b28f34b54770e81951967e20},
  journal = {Theory of Computing Systems},
  title = {INSERTION SORT Is O(nlogn)},
  year = 2006
}

@article{JLB84,
  author = {Bentley, John L.},
  editor = {of the ACM, Coninrunicatiorrs},
  interhash = {a477abaccb67e6507ca961b5e65ecd9a},
  intrahash = {d4706d21afbb4e5cef97cc3817471655},
  journal = {Coninrunicatiorrs of the ACM },
  title = {Programming Pearls, How to Sort},
  year = 1984
}

@conference{YYPG11,
  author = {{Yang, You}, Ping Yu und Yan Can},
  booktitle = {Experimental study on the five sort algorithms.},
  editor = {Automation, Mechanic and (MACE), Control Engineering},
  interhash = {eaecc657b4cb7017ec37f40ce8ba9be6},
  intrahash = {cd329204fc2b60cc2076cfafc8fe51f1},
  title = {Experimental study on the five sort algorithms.},
  year = 2011
}

@book{EL1909,
  author = {E.Landau},
  interhash = {d6050765f9f13c697fe88dcc12825f10},
  intrahash = {6bcf3f0bb7418095e3fbed10b646c44a},
  publisher = {Teubner},
  title = {Handbuch der Lehre von der Verteilung der Primzahlen},
  year = 1909
}

@book{TSAS01,
  author = {Schicker Thomas, Angelika Steger},
  interhash = {2116513b4a15cb1232ed0d29515f6dc5},
  intrahash = {b5183e37c221c3ce03990c02d837cf0b},
  publisher = {Springer},
  title = {Wahrscheinlichkeitstheorie und Statistik},
  year = 2001
}

@book{WN02,
  author = {Narkiewicz, Wladyslaw},
  interhash = {12f5d0ff631750fb3ded3aab2e8d8191},
  intrahash = {a71f9c51307454bcdbff8e0984f7db9f},
  publisher = {Springer},
  title = {The Development of Prime Number Theory},
  year = 2002
}

@article{Hoare1961,
  author = {Hoare, C. A. R.},
  ee = {http://doi.acm.org/10.1145/366622.366644},
  interhash = {bd42d51836f956e2deebeb10b8e5f93a},
  intrahash = {1b58ff39c1c545c2be8114935d3c757d},
  journal = {Commun. ACM},
  number = 7,
  pages = 321,
  title = {Algorithm 64: Quicksort.},
  url = {http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b},
  volume = 4,
  year = 1961
}

@book{SS04,
  author = {Gunther Saake, Kai-Uwe Sattler},
  edition = 2,
  interhash = {867e8534d3bf16b7f08e6a5d704b2056},
  intrahash = {e075d46911b34a2117e147adfc56d177},
  publisher = {dpunkt.Verlag},
  title = {Algorithmen und Datenstrukturen, eine Einführung mit Java},
  year = 2004
}

@book{KM88,
  author = {Mehlhorn, K.},
  interhash = {387dc4b13714049cb4eb49de9a9178ba},
  intrahash = {3a3a90fe1758f2251276024fa3ccab2a},
  publisher = {Teubner},
  title = {Datenstrukturen und effiziente Algorithmen},
  year = 1988
}

@book{Knuth98,
  author = {Knuth, Doald E.},
  edition = 2,
  interhash = {e47a323b05aef0171943a3e11a25cac5},
  intrahash = {3c02ed196becb42920495a8569f6059d},
  publisher = {Addison-Wesley},
  series = {The Art of Computer Programming},
  title = {The Art of Computer Programming - sorting and searching},
  volume = 3,
  year = 1998
}

@book{NB13,
  author = {Blum, Norbert},
  edition = 2,
  interhash = {5b1a973887185f0c58bdc2bfa581e275},
  intrahash = {5fafefce3874724a2cb5d1ee739cffd7},
  publisher = {Oldenbourg Verlag},
  title = {Algorithmen und Datenstrukturen},
  year = 2013
}