- Related Questions & Answers
- Universal Hashing in Data Structure
- Double Hashing in Data Structure
- LCFS Hashing in Data Structure
- Asymmetric Hashing in Data Structure
- Hashing with Chaining in Data Structure
- Hashing by Multiplication in Data Structure
- Hashing by Division in Data Structure
- Hashing with Open Addressing in Data Structure
- Rectangle Data in Data Structure
- Halfedge data structure
- Deaps in Data Structure
- Quadtrees in Data Structure
- Arrays Data Structure in Javascript
- Stack Data Structure in Javascript
- Graph Data Structure in Javascript

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

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.

Advertisements