On: Big-O Algorithm Complexity Cheat Sheet

[pbiggar]

Thank you!

So if you put a bound on the size of the keys, let's say 32bit, it becomes linear? Obviously it would be cheating to put a giant number here :)

[nostrademons → pbiggar]

Right. Basically, if the key size is bounded, then k becomes a constant and it reduces to O(N).