Author: David Rasmussen
Date: 16:53:10 05/11/01
Go up one level in this thread
On May 11, 2001 at 13:45:33, Dann Corbit wrote: >On May 11, 2001 at 03:33:07, David Rasmussen wrote: >[snip] >>>So all of them are sorted in O(n) then! >>> >> >>I know. Radix Sort is the same. > >O(n) is not generally used to describe bucket sorting, radix sorting and the >like anymore. That's because keysize is so important. > >Generally, it is O(n*log(keysize/keybucketsize)) > I know. But I didn't want to go into that, as it was irrelevant for my argumentation.
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.