Hash Table: Difference between revisions

From NovaOrdis Knowledge Base
Jump to navigation Jump to search
Line 11: Line 11:


=Overview=
=Overview=
Hash tables are one of the most used data structures in programming. They don't have that many operations ([[#INSERT|INSERT()]], [[#DELETE|DELETE()]] and [[#SEARCH|SEARCH()]]), but what they do, they do really well.
=Canonical Use=
=Canonical Use=
* [[The 2-SUM Problem]]
* [[The 2-SUM Problem]]

Revision as of 19:48, 16 October 2021

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.

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