This is the mail archive of the
gsl-discuss@sourceware.cygnus.com
mailing list for the GSL project.
Re: suggest to add 'heapsort'.
- To: Brian Gough <bjg at network-theory dot co dot uk>
- Subject: Re: suggest to add 'heapsort'.
- From: Klaus Schilling <Klaus dot Schilling at munich dot netsurf dot de>
- Date: Wed, 3 Nov 1999 11:16:38 +0100 (CET)
- Cc: Thomas Walter <walter at pctc dot chemie dot uni-erlangen dot de>, gsl-discuss at sourceware dot cygnus dot com
- References: <199911020922.KAA18947@pchem2.chemie.uni-erlangen.de><14367.5633.314801.980909@localhost>
- Reply-To: Klaus dot Schilling at munich dot netsurf dot de
Brian Gough writes:
> Thanks. A heapsort would be useful as an alternative to qsort(). If
> you put the source somewhere and send the url to the list then we can
> download it from there. GSL uses size_t for indices, unsigned.
>
Would mergesort also be an alternative? It seems to be the only stable
O(n * log n ) sorting algorithm, though space intensive in turn.
Would it also be useful to consider container structures different
from static C arrays, such as lists or btrees? There are some
good GPL compatible libraries for container data structures now,
such as avltree, glib or libretto, which could be borrowed from.
Klaus Schilling