On Jan 16, 2012, at 05:35, Tom Marchant wrote: > On Fri, 13 Jan 2012 18:29:55 -0800, glen herrmannsfeldt wrote: > >>> The EX CLC is in fact in loop scanning a linked list for the right >>> entry among 100-200 elements. >> >> You could also do binary search, which will find the right entry >> with about log(n) comparisons. > > How do you do a binary search on a linked list? > B-tree?
-- gil
