- Data Structures & Algorithms
- DSA - Home
- DSA - Overview
- DSA - Environment Setup

- Algorithm
- DSA - Algorithms Basics
- DSA - Asymptotic Analysis
- DSA - Greedy Algorithms
- DSA - Divide and Conquer
- DSA - Dynamic Programming

- Data Structures
- DSA - Data Structure Basics
- DSA - Array Data Structure

- Stack & Queue
- DSA - Stack
- DSA - Expression Parsing
- DSA - Queue

- Searching Techniques
- DSA - Linear Search
- DSA - Binary Search
- DSA - Interpolation Search
- DSA - Hash Table

- Sorting Techniques
- DSA - Sorting Algorithms
- DSA - Bubble Sort
- DSA - Insertion Sort
- DSA - Selection Sort
- DSA - Merge Sort
- DSA - Shell Sort
- DSA - Quick Sort

- Graph Data Structure
- DSA - Graph Data Structure
- DSA - Depth First Traversal
- DSA - Breadth First Traversal

- Tree Data Structure
- DSA - Tree Data Structure
- DSA - Tree Traversal
- DSA - Binary Search Tree
- DSA - AVL Tree
- DSA - Spanning Tree
- DSA - Heap

- DSA Useful Resources
- DSA - Questions and Answers
- DSA - Quick Guide
- DSA - Useful Resources
- DSA - Discussion

# Robin-Hood Hashing in Data Structure

In this section we will see what is Robin-Hood Hashing scheme. This hashing is one of the technique of open addressing. This attempts to equalize the searching time of element by using the fairer collision resolution strategy. While we are trying to insert, if we want to insert element x at position xi, and there is already an element y is placed at y_{j} = x_{i}, then the younger of two elements must move on. So if i ≤ j, then we will try to insert x at position x_{i+1}, x_{i+2} and so on. Otherwise we will store x at position x_{i}, and try to insert y at position y_{j+1}, y_{j+2} and so on.

According to Devroye et al. show that after performing n insertions on an initially empty table, whose size is đť‘š = Αđť‘›, using the Robin-Hood insertion algorithm, the expected value of worst case search time is −

$$E[W]=\Theta(log\:log\:n)$$

And its bound is tight. So this algorithm is a form of Open addressing, that has doubly logarithmic worst-case search time.

- Related Articles
- Universal Hashing in Data Structure
- Double Hashing in Data Structure
- Asymmetric Hashing in Data Structure
- LCFS Hashing in Data Structure
- Hashing by Division in Data Structure
- Hashing by Multiplication in Data Structure
- Hashing with Chaining in Data Structure
- Hashing with Open Addressing in Data Structure
- Rectangle Data in Data Structure
- Deaps in Data Structure
- Quadtrees in Data Structure
- How CSS work under the hood?
- Halfedge data structure
- Booleâ€™s Inequality in Data Structure
- Bayesâ€™ Rule in Data Structure