From: David B. <Dav...@mo...> - 2004-01-22 21:44:36
|
Dapr=E8s Paul Thomas <pau...@wa...> (le 22/01/2004): > In conclusion, I will use your sort algorithm but found mine to be an=20 > 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=3Dsort(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 --=20 David Bateman Dav...@mo... Motorola CRM +33 1 69 35 48 04 (Ph)=20 Parc Les Algorithmes, Commune de St Aubin +33 1 69 35 77 01 (Fax)=20 91193 Gif-Sur-Yvette FRANCE The information contained in this communication has been classified as:=20 [x] General Business Information=20 [ ] Motorola Internal Use Only=20 [ ] Motorola Confidential Proprietary |