From: Colin James 0621 <cjames@dsc.blm.gov>
Subject: Displacement Address Sort source code in Ada
Date: Sun, 26 Sep 93 11:56:30 MDT [thread overview]
Message-ID: <9309261156.aa13653@dsc.blm.gov> (raw)
Below is a type of distribution counting sort which performs about
50 times better than quicksort on the data set included.
Thanks are due to Mike Feldman, Peter Gural, Robert Sedgewick, and Roger
Hunter. Please distribute with the text of the test results.
This code may be obtained from "dsc.blm.gov" by anonymous ftp. It is
located in /pub/ada.dir^[[D^[[D^[[D^[[D^[[D^[[D^[[D^[[D^[[D^[[D^[[D^[[D"/pub/ada.dir".
Note: a version implementing a straight insertion sort for 17 or less
items is in process with further test results forthcoming.
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
/develop/ftp/pub/ada.dir/dispadsrt.ada
next reply other threads:[~1993-09-26 17:56 UTC|newest]
Thread overview: 2+ messages / expand[flat|nested] mbox.gz Atom feed top
1993-09-26 17:56 Colin James 0621 [this message]
-- strict thread matches above, loose matches on Subject: below --
1993-09-26 18:02 Displacement Address Sort source code in Ada Colin James 0621
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox