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).
[ Parent
| on HN ]
There are no comments on this comment yet.