🚀 go-pugleaf

In article <36E25866.C59633B5@dds.nl>, Robbert Jager wrote:
Hello,

>I ran into the c-code of a countsort program. People say that this is
>the quickest sorting method available. Most of the source i understand
>but there are three for-loops in which i don't realy know what they
>do....

the code is trash (sorry to say that), but if you use it, then ...
[...]
>  /* ???? */
>  for (i = 0; i < n; i++)
>    {
>      ++c[a[i]];
>    }
[...]
... try this 8)

/*
** on a 32 bit machine INT_MAX is 2147483647, on a 16 bit machine
** 65535 and ++c[a[i]] will write straight into somewhere.
*/

>int a[] = { INT_MAX, 8, 6, 4, 3, 8, 0 };

... *BOOM* ... must be part of Win98 ... 8->>

Cheers,
Juergen

-- 
\ Real name     : J�rgen Heinzl                 \       no flames      /
 \ EMail Private : juergen@monocerus.demon.co.uk \ send money instead /
  \ Phone Private : +44 181-332 0750              \                  /