im doing research on sorting algorithms. i have 2 articles about radix sort. one says radix sort is O(n), in other words linear. the other says it is only linear if the wordsize of the computer(32 or 64 nowadays) is >= log n, otherwize it its O(n log n). isnt log 1,000,000 only 6?
even if they mean log base 2, 2^32 is a huge number
ps: the second article introduces an algorithm with O(n log log n)
[ April 18, 2004: Message edited by: Randall Twede ]