On Thu, Aug 18, 2011 at 2:32 PM, Rob van der Heij <[email protected]> wrote: > On Thu, Aug 18, 2011 at 2:02 PM, Paul Lautman <[email protected]> > wrote: >> Is that likely to be more efficient than the lookup? Or is it only so >> because the reference set is so small?
No doubt John knew already the break-even is at 4 strings, so that's why he offered this one for 3 strings... With 10 strings of 3 bytes each, my lookup solution is still 3300 but the Piper's approach with pick takes 6000 already. "Lookup is better. It just depends on the quantity..." :-) http://rvdheij.wordpress.com/2011/06/29/it-works-better-with-lookup/
