Hash Table: Difference between revisions
Jump to navigation
Jump to search
| Line 14: | Line 14: | ||
=Hash Table= | =Hash Table= | ||
=TODO= | |||
<font color=darkgray>TODO [[Hash Map]]</font> | |||
Revision as of 21:49, 17 August 2018
Internal
Overview
A hash table is a dynamic set that supports INSERT, DELETE and SEARCH - a dictionary.
Time Complexity
In the worst case, searching an element in a hash table can take as long as the search in a linked list Θ(n). However, on average SEARCH, INSERT and DELETE operations take O(1).
Direct-Address Table
Hash Table
TODO
TODO Hash Map