OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

Quadratic probing

 Home Mathematics Fields of mathematics Applied mathematics Algorithms Search algorithms
 0 By others on same topic  0 Discussions  1970-01-01  See my version
Quadratic probing is a collision resolution technique used in open addressing hash tables. Open addressing is a method of handling collisions when two keys hash to the same index in the hash table. In quadratic probing, the algorithm attempts to find the next available position in the hash table by using a quadratic function of the number of probes. ### How Quadratic Probing Works: 1. **Hash Function**: When inserting a key into the hash table, a hash function computes an initial index.

 Ancestors (6)

  1. Search algorithms
  2. Algorithms
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook