Last update: Sat Jan 6 02:03:49 MST 2018
@Article{McCulloch:1982:QDS, author = "C. M. McCulloch", title = "{Quickshunt} --- a Distributive Sorting Algorithm", journal = j-COMP-J, volume = "25", number = "1", pages = "102--104", month = feb, year = "1982", CODEN = "CMPJA6", DOI = "https://doi.org/10.1093/comjnl/25.1.102", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Tue Dec 4 14:48:12 MST 2012", bibsource = "Compendex database; http://comjnl.oxfordjournals.org/content/25/1.toc; http://www.math.utah.edu/pub/tex/bib/compj1980.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_01/", URL = "http://comjnl.oxfordjournals.org/content/25/1/102.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_01/tiff/102.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_01/tiff/103.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_01/tiff/104.tif", acknowledgement = ack-nhfb, classcodes = "C6130 (Data handling techniques)", classification = "723", fjournal = "The Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", keywords = "computer programming --- Algorithms; computer systems programming; distributive sorting algorithm; non-radix; QUICKSHUNT; sorting; train-shunting", treatment = "P Practical", }