Hash Table

From NovaOrdis Knowledge Base
Revision as of 19:52, 16 October 2021 by Ovidiu (talk | contribs) (→‎Overview)
Jump to navigation Jump to search

External

Internal

Overview

Hash tables are one of the most used data structures in programming. They don't have that many operations (INSERT(), DELETE() and SEARCH()), but what they do, they do really well. Conceptually, a hash table is an array that provides immediate random access for constant time insertion, deletion and lookup based on an arbitrary key and not an integral index.

Canonical Use

Hash Table Implementation Discussion

Chaining

Linear Probing

Hash Functions

Supported Operations

INSERT(X)

INSERT(X)

DELETE(K)

DELETE(X)

SEARCH(K)

SEARCH(K)

TO DEPLETE

HashTableTODEPLETE