> PE> One way is to create an array containing pointers to all
 > PE> your elements in the linked list, and then sort that instead.
 > PE> I've never tried it myself.

 > Is there an easy way of initialising this array of pointers
 > without resorting to any trickery or 'bad code' ??

Sure.  Why would you need to use "trickery or 'bad code'" anyway?

You can either walk the list once to count the number of elements (and
therefore know how large an array of allocate), then walk it again and fill
in the array, or you can use realloc() to change the size of the array as
required.  If your linked list maintains a count of active elements as each
one is added or deleted, then this is made even easier and faster.

However, if you want to avoid using the secondary array altogether and use
some quite nice code to sort linked lists directly using mergesort or
quicksort, then locate the C_ECHO snippets file.  The one available here is
SNIP0493.ZIP, but a new one has been recently released (SNIP9404.ZIP) which
I'll probably have on line in a few days.


  cheers,
  david

---