Re: fast stable sort
- From: cri@xxxxxxxx (Richard Harter)
- Date: Fri, 14 Nov 2008 22:32:03 GMT
On Fri, 14 Nov 2008 17:18:45 -0500, CBFalconer
<cbfalconer@xxxxxxxxx> wrote:
pete wrote:
Richard Harter wrote:
There are in place stable versions of mergesort.
Can you post C code for a stable in place mergesort function?
Such exists in wdfreq.c, an example program on the use of hashlib.
wdfreq has been put in public domain, hashlib is released under
GPC. See:
<http://cbfalconer.home.att.net/download/hashlib.zip>
The context is in-place with O(1) extra storage; use of an
auxilliary linked list is not on the table.
Richard Harter, cri@xxxxxxxx
http://home.tiac.net/~cri, http://www.varinoma.com
Save the Earth now!!
It's the only planet with chocolate.
.
- Follow-Ups:
- Re: fast stable sort
- From: CBFalconer
- Re: fast stable sort
- References:
- fast stable sort
- From: subramanian100in@xxxxxxxxx, India
- Re: fast stable sort
- From: pete
- Re: fast stable sort
- From: Richard Harter
- Re: fast stable sort
- From: pete
- Re: fast stable sort
- From: CBFalconer
- fast stable sort
- Prev by Date: Re: Red-black trees?
- Next by Date: Re: String count algorithm
- Previous by thread: Re: fast stable sort
- Next by thread: Re: fast stable sort
- Index(es):