Hash Table: Difference between revisions
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. Conceptually, a hash table is an array that provides constant time insertion, deletion and lookup based on '''an arbitrary key''' and not an integral index. | 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. 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= | =Canonical Use= | ||
Revision as of 19:52, 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. 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.