News for hackers. Stuff that matters.
Re:Big-O Algorithm Complexity Cheat Sheet by pbiggar on Saturday May 04, 2013 @02:29PM (#5655806)
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 :)

Re:Big-O Algorithm Complexity Cheat Sheet by nostrademons on Saturday May 04, 2013 @03:18PM (#5655999)
Right. Basically, if the key size is bounded, then k becomes a constant and it reduces to O(N).