![]() ![]() Each element is assigned a key (converted key). The idea of hashing is to distribute entries (key/value pairs) uniformly across an array. The values are then stored in a data structure called hash table. In hashing, large keys are converted into small keys by using hash functions. However, in cases where the keys are large and cannot be used directly as an index, you should use hashing. To store the key/value pair, you can use a simple array like a data structure where keys (integers) can be used directly as an index to store values. In both these examples the students and books were hashed to a unique number.Īssume that you have an object and you want to assign a key to it to make searching easy. In libraries, each book is assigned a unique number that can be used to determine information about the book, such as its exact position in the library or the users it has been issued to etc.In universities, each student is assigned a unique roll number that can be used to retrieve information about them.Some examples of how hashing is used in our lives include: Hashing is a technique that is used to uniquely identify a specific object from a group of similar objects. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |