O'Reilly logo
  • Alberto Villarreal thinks this is interesting:

To identify the feature of an application that permits the Direct Hashing function to approach a minimal perfect hashing function we will revisit the use of this algorithm in our stadium ticket database example. The reason the loading factor was low for that application was that there were 1,000,000 possible ticket numbers (key values) and a place in the primary storage area had to be provided for each of them, even though only 10,054 of these keys would actually by stored. Now consider the case where the 10,054 ticket numbers no longer include an encoding of the event number and date. In this case, the ticket numbers can be the seat numbers and there are only 10,054 possible key values; meaning, we only need to a...


Cover of Data Structures and Algorithms Using Java


Cont aqui WEDN