On Mon, Aug 10, 2009 at 12:06 PM, Ola Bini <ola.b...@gmail.com> wrote:
> >> It is O(k) where k = length of lookup string. But, in practice, where the >> set of strings that is being stored is a set of method names (mostly human >> generated), you never hit the worst case. >> >> Yeah, n was length of lookup string in my case to. Okay. I misunderstood you then. So, this basically boils down to the size of the constants in the O and >> other implementation and platform details. >> > > My main problem is the size and array lookup. > > And since my experiences trying this, as I mentioned earlier, it ended up > significantly worse. > I have no reason to believe otherwise since you actually implemented tries. As I said, I wasn't thinking about hashes when I posted that note, sorry to waste everyone's time on this. :-) Subbu.
