[Date Prev][Date Next][Thread Prev][Thread Next]
- Subject: Re: Counts, #, getn, etc
- From: Mark Hamburg <mhamburg@...>
- Date: Fri, 02 Dec 2005 09:16:46 -0800
on 12/2/05 5:11 AM, Roberto Ierusalimschy at firstname.lastname@example.org wrote:
>> I guess it's entirely possible that one can binary search the array
>> faster than a couple table lookups to find the cached value for getn.
> That was the case last time we measured. (At least for small tables,
> with up to some 200,000 elements...)
I can believe that argument and I will stop worrying now. Constant factors
trump big-O behavior in a lot of cases.