Quadratic probing
id:
quadratic-probing-294-3798563
title:
Quadratic probing
text:
Quadratic probing is an open addressing scheme in computer programming for resolving hash collisions in hash tables. Quadratic probing operates by taking the original hash index and adding successive values of an arbitrary quadratic polynomial until an open slot is found. An example sequence using quadratic probing is: H + 1 2 , H + 2 2 , H + 3 2 , H + 4 2 , . . . , H + k 2 Quadratic probing is often recommended as an alternative to linear probing because it incurs less clustering. Quadratic pro
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Quadratic_probing
date created:
date modified:
2023-11-28T01:08:25Z
main entity:
{"identifier":"Q7268367","url":"https://www.wikidata.org/entity/Q7268367"}
image:
fields total:
13
integrity:
13