Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.3 4.3bsd-beta 6/6/85; site ablnc.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!mhuxr!mhuxt!houxm!whuxl!whuxlm!akgua!akguc!codas!generic!ablnc!rcpilz
From: rcpilz@ablnc.UUCP (Robert C. Pilz)
Newsgroups: net.lang.c
Subject: Sorting linked lists
Message-ID: <165@ablnc.UUCP>
Date: Thu, 13-Mar-86 11:28:11 EST
Article-I.D.: ablnc.165
Posted: Thu Mar 13 11:28:11 1986
Date-Received: Sat, 15-Mar-86 04:08:28 EST
Organization: AT&T Information Systems, Maitland, Florida
Lines: 14
Keywords: Sort link-list


 
I would like some advice on sorting linked lists. I
am running SVR2 UNIX on a VAX 11/780 and 3B20S. I
would like to know if there is a way to sort a linked list.
I know that a table can be sorted via qsort(3c). But
it assumes that every element is contiguous in memory.
In a linked list this is not the case. Do I do a
memory copy of some type to get the link list contiguous?
I would like to know what works.
 
Send replies to:
ihnp4!abfll!rcpilz
Thanks