Hashing & collisions

About this app

How a string becomes a table slot: the calculator processes the input character by character with the actual numbers plugged in, ending in hash mod m. Six methods from deliberately bad (length, first letter, character sum) to usable (polynomial hash as in Java, djb2, FNV-1a) run against the same words — anagrams collide under the sum, similar words clump, and even the best function has collisions. Bit comparison of two inputs, prime vs. power-of-two table size, statistics against the ideal.

Subject: Computer science

More from Computer science

• Ackermann function
• Elevator simulator
• Binary workshop
• Binary versus linear search
• The Collatz problem
• Inside a CPU
• Function rooms in 3D
• Floating-point anatomy

A VisuApp by heyprof: interactive, free in your browser, no sign-up. What is a VisuApp? · All apps