🚀 go-pugleaf

>A radix sort has a time complexity of O(N), which means that it
>operates in linear time on N units of data.

Gee, I'm sure the theoreticians would LOVE to see the algorithm,
since it has been PROVED long ago that sorting takes O(N log N)
time OPTIMALLY.

>This integer may then be
>represented as the path in a binary tree, with the higher order
>bits represented as paths near the root and the lower order bits as
>paths near the leaves.

Guess what?  The number of bits will be of the order LOG N !!!!!!


Let's rename this group to rec.games.!programmer, and succumb to the
community's belief that "games programmers" aren't real programmers
at all.  All the Windows programmers and DOS device driver programmers
can then cross there arms smugly and shake their heads at us non-
programmers, who can only write GAMES, saying "gee, they've discovered
SORTING"...

Come on people, games programming is definately an art-form, but we
really must learn to hold our mallet and chisel correctly.  (Of course,
asm programmers only need to learn to hold the chisel, since they use
their head to supply the force).

--
Warwick
--
  _-_|\      warwick@cs.uq.oz.au            /Disclaimer:
 /     * <-- Computer Science Department,  /  
 \_.-._/     University of Queensland,    /   C references are NULL && void*
      v      Brisbane, Australia.        /