Lesson: Hashing

Rooms on the shortest path to this room

• Programming Land MOO Entry Way
• Language Foyer
• Data Structures
• Important Algorithms
• Hashing

• Hashing Case Study
• In Search of the Minimal Perfect Hash(#10709)
  • First Step in Generating a Hash Function(#11651)
    • Mapping(#11653)
      • Folding(#11655)
        • Shifting(#11657)
          • Random Numbers and Casts(#11659)
            • Beware of Short Character Strings!(#11661)
              • Second Step in Generating a Hash Function(#11663)
                • Bringing Down the Range by Integer Division(#11665)
                  • Bring Down the Range Using Bitwise Shift(#11667)
                    • Using Bitwise Logical Operators(#11669)
                      • Search for the Perfect Hash Function(#11671)
                        • Example(#11673)
• Analysis of Hashing(#11583)
  • How likely are collisions?(#11631)
    • Programs with Good Rehash Algorithms(#11632)
      • Programs with Linear Probing(#11630)
• Introduction to Hashing

Return to the top lesson page.

Index of lessons.

This page created on 8/22/2006