Re: [Algorithms] small part of large database

[Paul S. <pa...@cl...>]

David Hunt <da...@hu...>'s mouth runneth over with
>Most of the time I keep them in numeric order and binary search - however
>for those dynamic cases you won't beat an RB tree.

Unless a hash happens to be faster ;) This is the sort of problem
hashing was invented for.

-- 
Paul Shirley
Climax Nottingham