The hash code, which is an integer, is then mapped to the fixed size we have. The key, which is used to identify the data, is given as an input to the hashing function. In hash tables, you store data in forms of key and value pairs. Generally, these hash codes are used to generate an index, at which the value is stored.
This so-called hash code (or simply hash) can then be used as a way to narrow down our search when looking for the item in the map. Hashing means using some function or algorithm to map object data to some representative integer value. Hashing is a technique to make things more efficient by effectively narrowing down the search at the outset.
Even if the list of words are lexicographically sorted, like in a dictionary, you will still need some time to find the word you are looking for. Hashing is designed to solve the problem of needing to efficiently find or store an item in a collection.įor example, if we have a list of 10,000 words of English and we want to check if a given word is in the list, it would be inefficient to successively compare the word with all 10,000 items until we find a match.
0 kommentar(er)
