On 29/02/2012 8:44 PM, John Gilmore wrote:
The table involved is short; it is ordered; it can be searched using very efficient glb-seeking binary search; this table grows very slowly;
Wouldn't a "perfect hash" algorithm be quicker?
John Gilmore, Ashland, MA 01721 - USA ---------------------------------------------------------------------- For IBM-MAIN subscribe / signoff / archive access instructions, send email to [email protected] with the message: INFO IBM-MAIN
---------------------------------------------------------------------- For IBM-MAIN subscribe / signoff / archive access instructions, send email to [email protected] with the message: INFO IBM-MAIN
