Implementation of The FlashSort1 Algorithm

 as described by Karl-Dietrich Neubert
 in Dr. Dobb's Journal, February 1998

 adapted to ANSI C for research purposes
 by Andreas R. Kleinert in 1998; also added test program


 About Flashsort:

 It's simply faster than Heapsort, Quicksort and Quickersort.
 On 10000 items it's twice as fast as Quickersort.

 For more information, please refer to the original article.


 Changes since last release:

   - changed x=3 to x=3 in 3rd loop (oops)
   - NUM2 now calculated correctly

 --
 ARK, 05/Dec/98

 PERMSSN    UID  GID    PACKED    SIZE  RATIO     CRC       STAMP          NAME
---------- ----------- ------- ------- ------ ---------- ------------ -------------
[generic]                  220     458  48.0% -lh5- 8ff5 Nov 21  1998 flashsort/flash.h
[generic]                   87     116  75.0% -lh5- beab Nov 21  1998 flashsort/SCOPTIONS
[generic]                   78     132  59.1% -lh5- 0860 Nov 21  1998 flashsort/smakefile
[generic]                   72      79  91.1% -lh5- 82b4 Nov 21  1998 flashsort/smakefile.wth
[generic]                  391     835  46.8% -lh5- 6bbe Nov 21  1998 flashsort/test.info
[generic]                  697    1761  39.6% -lh5- 7c25 Dec  5  1998 flashsort/flash.c
[generic]                  476     564  84.4% -lh5- 122e Dec  5  1998 flashsort/flash.o
[generic]                  428     695  61.6% -lh5- 06a2 Dec  5  1998 flashsort/flashsort.readme
[generic]                 5662    8624  65.7% -lh5- 3e7e Dec  5  1998 flashsort/test
[generic]                  461     970  47.5% -lh5- 10d7 Dec  5  1998 flashsort/test.c
[generic]                  489     728  67.2% -lh5- 2e33 Dec  5  1998 flashsort/test.o
---------- ----------- ------- ------- ------ ---------- ------------ -------------
 Total        11 files    9061   14962  60.6%            Dec  5  1998