|
|
|
|
|
|
by jqpabc123
2030 days ago
|
|
|
It's often possible to do "better" by tuning something toward the data set. Finding something that is always better is hard. One thing I have done is a double binary search. Store prefixes and suffixes seperately. A binary search of the prefixes identifies the suffix clump to search with a binary search. This involves a slight increase in storage --- each prefix needs a suffix pointer. But maybe I will now try an interpolation search on the suffixes. |
|
|