News for hackers. Stuff that matters.
Re:The Trie: A Neglected Data Structure by nawitus on Friday September 13, 2013 @11:11AM (#6380978)
But if an algorithm is O(0.5), then it also belongs to O(1) and O(5), e.g. the time is constant and doesn't change with the problem size.

There are no comments on this comment yet.