Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!uunet!mcsun!ukc!icdoc!zmacy67
From: zmacy67@doc.ic.ac.uk (Roger Attrill)
Newsgroups: comp.graphics
Subject: all sorts
Summary: want algorithms for fast sorts - shell metzner !
Keywords: sorts, shell-metner
Message-ID: <1857@gould.doc.ic.ac.uk>
Date: 3 May 90 12:54:59 GMT
Sender: news@doc.ic.ac.uk
Reply-To: zmacy67@doc.ic.ac.uk (Roger Attrill)
Distribution: comp.graphics
Organization: Imperial College Department of Computing
Lines: 18


  I am currently writing a 3-D solids modeller.  A simple part of this
requires the depth sorting of a large number of triangular surfaces. While
the quicksort algorithm is ok, I have heard of the Shell-Metzner sort,
(actual spelling unknown). I have even spoken to two other people who
have heard of it, but I can't find anyone who has GOT it. If any one knows
the algorithm, or knows someone who knows someone .....   then I'd be very
grateful. Also If anyone knows any other very fast sorting algorithms ( ie 
faster than quicksort ) then I'd like to hear from you.

  Thanks.


=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-
|   Roger C. Attrill   |   *  *    I don't think therefore I'm not    *  *   |
| zmacy67@doc.ic.ac.uk |              More variations on a theme             |
|   Imperial College   |               same time next week folks             |
=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-