

- Trending Categories
Data Structure
Networking
RDBMS
Operating System
Java
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
Linear Probing in Data Structure
In this section we will see what is linear probing technique in open addressing scheme. There is an ordinary hash function h´(x) : U → {0, 1, . . ., m – 1}. In open addressing scheme, the actual hash function h(x) is taking the ordinary hash function h’(x) and attach some another part with it to make one linear equation.
h´(ð‘¥) = ð‘¥ ð‘šð‘œð‘‘ ð‘š
ℎ(ð‘¥, ð‘–) = (ℎ´(ð‘¥) + ð‘–)ð‘šð‘œð‘‘ ð‘š
The value of i| = 0, 1, . . ., m – 1. So we start from i = 0, and increase this until we get one freespace. So initially when i = 0, then the h(x, i) is same as h´(x).
Example
Suppose we have a list of size 20 (m = 20). We want to put some elements in linear probing fashion. The elements are {96, 48, 63, 29, 87, 77, 48, 65, 69, 94, 61}
Hash Table
- Related Questions & Answers
- Quadratic Probing in Data Structure
- Explain the Difference Between Linear and Non-linear Data Structure
- Explain linear data structure queue in C language
- C++ Program to Implement Hash Tables with Linear Probing
- Implementing own Hash Table with Open Addressing Linear Probing in C++
- Floyd Cycle Detection Algorithm to detect the cycle in a linear Data Structure
- Rectangle Data in Data Structure
- Difference between Linear and Non-linear Data Structures
- 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
- Queue Data Structure in Javascript
Advertisements