Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!watmath!clyde!cbosgd!gatech!seismo!umcp-cs!chris
From: chris@umcp-cs.UUCP (Chris Torek)
Newsgroups: net.lang.c
Subject: Re: Sorting linked lists
Message-ID: <408@umcp-cs.UUCP>
Date: Thu, 20-Mar-86 05:26:33 EST
Article-I.D.: umcp-cs.408
Posted: Thu Mar 20 05:26:33 1986
Date-Received: Fri, 21-Mar-86 07:02:56 EST
References: <165@ablnc.UUCP> <6721@cca.UUCP>
Organization: U of Maryland, Computer Science Dept., College Park, MD
Lines: 16

In article <6721@cca.UUCP> g-rh@cca.UUCP (Richard Harter) writes:
[in response to my heap sort]

>A simpler method, given qsort with a compare function as an
>argument, is to create an array of pointers to the nodes
[and sort through the pointers].

Indeed you can; I was simply trying to avoid using extra space.
(And I had a lot of fun writing my first ever heap sort.)

Personally, I like the merge sort in article <402@mips.UUCP> by
hansen@mips.  Maybe I will convert that one next.
-- 
In-Real-Life: Chris Torek, Univ of MD Comp Sci Dept (+1 301 454 1415)
UUCP:	seismo!umcp-cs!chris
CSNet:	chris@umcp-cs		ARPA:	chris@mimsy.umd.edu