Hash Table: Difference between revisions
Jump to navigation
Jump to search
| Line 8: | Line 8: | ||
<font color=darkgray>TODO [[Hash Map]]</font> | <font color=darkgray>TODO [[Hash Map]]</font> | ||
=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= | =Direct-Address Table= | ||
=Hash Table= | =Hash Table= | ||
Revision as of 21:48, 17 August 2018
Internal
Overview
A hash table is a dynamic set that supports INSERT, DELETE and SEARCH - a dictionary.
TODO Hash Map
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).