Quadratic Probing for Conflict Resolution in Hash Tables

Build Your Own Redis / DNS / BitTorrent / SQLite - with CodeCrafters.

In the previous video, we explored quadratic probing as an alternative to linear probing to handle hash table collisions more effectively. Quadratic probing uses a quadratic function to find the next available slot, reducing clustered collisions compared to linear probing. While it offers better spacing for collided keys and leverages CPU cache, it is not immune to clustered collisions and lacks the same level of cache optimization as linear probing. Understanding these nuances helps in deciding between linear and quadratic probing for hashtable implementations.

# Recommended videos and playlists

If you liked this video, you will find the following videos and playlists helpful

# Things you will find amusing

# Other socials

I keep writing and sharing my practical experience and learnings every day, so if you resonate then follow along. I keep it no fluff.

Thank you for watching and supporting! it means a ton.

I am on a mission to bring out the best engineering stories from around the world and make you all fall in
love with engineering. If you resonate with this then follow along, I always keep it no-fluff.