Date: Wed, 5 Mar 1997 09:17:35 -0700 (MST)
From: David May <dmay AT tvi DOT cc DOT nm DOT us>
To: KaRNaGE <dlydiard AT linknet DOT kitsap DOT lib DOT wa DOT us>
cc: djgpp AT delorie DOT com
Subject: Re: Merge Sort: Doubly Linked List
In-Reply-To: <Pine.SUN.3.95.970304210735.23741A-100000@linknet.kitsap.lib.wa.us>
Message-ID: <Pine.SOL.3.95.970305090947.3617B-100000@curie.tvi.cc.nm.us>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII


On Tue, 4 Mar 1997, KaRNaGE wrote:

> every sort, while a binary search is pretty fast, an insertion sort, is
> pretty slow...the reason i was looking for a VERY fast rootine, was
> because i was sorting the Z values of a 3d object at realtime...thankz for
> your input though....laterz...
> 

I'm sorry I didn't make this clear - I had someone in my office when I was
trying to write the note to you.  The sort routine that I have is an
insertion sort only in that nodes get sorted as they are inserted, rather
than after the list is build.  However, the algorithm uses a binary search
routine to tell the list manager where to insert the next node.  However,
this is a list management package, and it sounds like you have the list
routines and simply want to sort them.  I don't know if my routine will
help you, but if you want a binary sort into a list, you may want to look
at it.

Good luck.

David May
ID Card Adminstrator
Albuquerque TVI