Last update: Sat Jan 6 02:03:49 MST 2018
@Article{Erkio:1984:WCP,
author = "Hannu Erki{\"o}",
title = "The worst case permutation for median-of-three
quicksort",
journal = j-COMP-J,
volume = "27",
number = "3",
pages = "276--277",
month = aug,
year = "1984",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/27.3.276",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:17 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/27/3.toc;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_03/",
URL = "http://comjnl.oxfordjournals.org/content/27/3/276.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_03/tiff/276.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_03/tiff/277.tif",
acknowledgement = ack-nhfb,
classcodes = "C6130 (Data handling techniques)",
classification = "723",
corpsource = "Dept. of Computer Sci., Univ. of Helsinki, Helsinki,
Finland",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "computer programming --- Algorithms; computer systems
programming; median-of-three quicksort; sorting; worst
case permutation",
treatment = "P Practical",
}