Re: benchmarks - sort

[David Bateman]

Daprès Paul Thomas <address@hidden> (le 22/01/2004):
> In conclusion, I will use your sort algorithm but found mine to be an 
> interesting exercise.

Except that the version I previously sent, I introduced a bug when fixing
a seg-fault. The result was that it didn't always do the last merge. The
fix unfortunately slows things up a bit, though at worst case "b=sort(a)"
is only 1.5 times as long as matlab, and still much better for partially
ordered lists....

I attach the patch, in case you want to test it, but will try and commit
the code...

Cheers
David

-- 
David Bateman                                address@hidden
Motorola CRM                                 +33 1 69 35 48 04 (Ph) 
Parc Les Algorithmes, Commune de St Aubin    +33 1 69 35 77 01 (Fax) 
91193 Gif-Sur-Yvette FRANCE

The information contained in this communication has been classified as: 

[x] General Business Information 
[ ] Motorola Internal Use Only 
[ ] Motorola Confidential Proprietary

patch.gz
Description: Binary data