Re: Simple disk-based sorting method

On Sat, 14 Apr 2007 15:44:01 -0500, Last Boy Scout
<BadBill@[EMAIL PROTECTED]
> wrote:

>Try using a bubble sort.  It is not fast but it works.

I have written C code for the bubble sort so I am familar with it. But
I still have the problem that I have limited memory so I would have to
implement it on disk files which is not all that difficult.

And there is the added problem that it grows in complexity as O(N^2),
whereas the Radix Sort grows as O(N). Actually the Radix Sort grows as
O(kN) where k is the key length. However it is still linear in the
number of records N. I was impressed with the speed of the disk-file
based Radix Sort.

Also I want to use the Radix Sort since I already have the code
written which means I can use it as a C function with variable
parameters.


--

"Nothing in the world can take the place of perseverance. Talent
will not; nothing is more common than unsuccessful men with talent.
Genius will not; unrewarded genius is almost a proverb. Education
will not; the world is full of educated derelicts. Persistence and
determination alone are omnipotent."
--Calvin Coolidge