What is the BEST hashing algorithm? | Comparing separate chaining and open addressing | Java

In this video I cover the fundamentals of hashing and hash tables. Then, I run some bench-marking experiments in Java using Java Micro-benchmarking Harness in order to determine which algorithm between Open Addressing and Separate Chaining has better performance. I also compare it against Java's Hash Map which uses both linked list chaining and binary search tree chaining. In terms of performance I check both throughput (ops/second) and memory allocation (MB/s).

Don't forget to like and subscribe!

Link to source code:

Chapters:
0:00 Intro
0:29 Hashtable review
3:13 Benchmarking methodology
4:31 Results
6:18 Which algorithm is best?
7:49 Outro

[samcousins]

i love your vibes man. can really tell you're having fun with it all. great video and good luck

[jonathana]

Amazing content! Your next video should be about how to make pivot tables in R!

[gregweed]

thank you i needed this in my life. I think you should do fortnite lets plays

[samuraidog]

Bro had that lightskin stare at the start