Re:Big-O Algorithm Complexity Cheat Sheet
by geophile on Saturday May 04, 2013 @09:55PM
(#5657129)
It all depends on what you're counting. Sort algorithm analysis typically counts key comparisons or record movement. In radixsort (and trie algorithms in general), you are relying on operations on digits of the key, not comparisons of entire keys. So linear isn't necessarily wrong, but you do have to say what you're counting.
Number theory? Not seeing the connection.