Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

book chapter · Apress eBooks · 2020

Hash Table

Elshad Karimov

Cited by 2Abstract and details only

Abstract

A hash table is a data structure of “associative arrays” that groups values in an index and sorts and retrieves data using a key/value mapping. It accomplishes the same goal in some cases like Swift dictionaries. However, the efficiency of hash tables is better than dictionaries. The time complexity for searching, inserting, and deleting is on average O(1), which means that regardless of the size of the input operation time remains constant. This solves the problem of the linear search operation which is costly and the time complexity is O(n). By calculating the hash value, we can find the index and place the value in this index and retrieve the value based on it.

Cite this paper

APA 7

Karimov, E. (2020). Hash Table. Apress eBooks, 55–60. https://doi.org/10.1007/978-1-4842-5769-2_7

MLA 9

Karimov, Elshad. “Hash Table.” Apress eBooks, 2020, pp. 55–60, https://doi.org/10.1007/978-1-4842-5769-2_7.

Chicago

Karimov, Elshad. 2020. “Hash Table.” Apress eBooks: 55–60. https://doi.org/10.1007/978-1-4842-5769-2_7.

Harvard

Karimov, E. (2020) ‘Hash Table’, Apress eBooks, pp. 55–60. Available at: https://doi.org/10.1007/978-1-4842-5769-2_7.

BibTeX
@incollection{karimov2020hash,
  title = {{Hash Table}},
  author = {Karimov, Elshad},
  booktitle = {Apress eBooks},
  pages = {55--60},
  year = {2020},
  doi = {10.1007/978-1-4842-5769-2_7}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.

Related papers