Current personal projects

Last update	21 March 1999	Author	Lionel Delafosse
Host address	http://www.citeweb.net/delafoss	E-mail	lionel_delafosse@mail.dotcom.fr

Building this site... ;-)

Improve Beta-Sort algorithm, a very fast algorithm (see this Benchmark).

Running times on a big file (10173 lines, 289ko) and very good conditions for Quicksort execution:
- Quicksort : 118.905 ms
- Beta-Sort : 38.575 ms

With Martin Waldenburg's Mwsort 1.2 program, Delphi 2, Windows 95, a Pentium 166MMX, a file of 50000 records (random generated) and finally a quick and dirty plug-in of Beta-Sort routine (in seconds):

	50 characters (2.5 Mo)	Ratio QS	100 characters (5 Mo)	Ratio QS
Comb Sort	7.288668935	1.82	7.1184029	1.52
Merge Sort	2.786671751	0.696	2.7872123	0.595
QuickSort	4.004912083	1	4.6827033	1
Beta-Sort	0.5524103655	0.138	0.4368276	0.093

CombSort and MergeSort are relatively stable over the two different files, QuickSort is unstable.

BetaSort is beetwen 7.25 and 10.75 faster than Quicksort (or have a ratio beetwen 9.3 % and 13.80 % ! .