| Hash Table |
|---|
| - Hash table is a data structure that stores keys and their corresponding values. It maintains an array for storing each item ( key -> value ). - Hash table makes use of a hash function to find the index into the array for inserting and searching an item ( key -> value ). - In C++ a hash table can be created using a map / multimap. - In Python a Hash table can be created as a dictionary. |
© 2019-2026 Algotree.org | All rights reserved.
This content is provided for educational purposes. Feel free to learn, practice, and share knowledge.
For questions or contributions, visit algotree.org
"Before software can be reusable it first has to be usable. - Ralph Johnson"