home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.unix.programmer
- Path: sparky!uunet!munnari.oz.au!manuel!coombs!avalon
- From: avalon@coombs.anu.edu.au (Darren Reed)
- Subject: Sorting technique..
- Message-ID: <avalon.712068179@coombs>
- Lines: 13
- Sender: news@newshost.anu.edu.au
- Organization: Computer Services Centre, Australian National University
- Date: 25 Jul 92 12:42:59 GMT
-
- Recently a friend and I were doing some manual sorting of paper
- documents. We divided the heap in half ( :) and proceeded from there
- using a variation on the insertion algorithm which was to not start
- searching for the place to insert the new entry at the top, but rather
- to start searching from where you last inserted an entry.
-
- Does anyone know of any papers or other documentation on this type
- of variation on the insertion sort and how it compares to normal
- insertion sorts ?
-
- thanks,
- Darren.
-