hashing ,hashtable,hash function

Hashing is a strategy for storing and recovering information from a database proficiently. 

Hashing is the change of a strings of characters into a normally shorter fixed-length value or key that speaks to the first string. Hashing is utilized to list and recover things in a database since it is quicker to discover the thing utilizing the shorter hashed key than to discover it utilizing the first worth. It is likewise utilized in numerous encryption algorithms. 

For arrays and linked list, we have to look in a linear manner, which can be expensive practically speaking.but insert and delete activities become expensive as we need to keep up order sorted. 

Hashing is the arrangement that can be utilized in practically all such circumstances and performs incredibly very much well,contrasted to the above data structures like Array, Linked List, Balanced BST . With hashing we get O(1) search time by and O(n) in most worst scenario.

hash function :

it is utilized to map data of arbitrary size to fixed-size values. The qualities returned by hash function are utilized to record a fixed-size table called a hash table. this method of Utilization of a hash function to index a hash table is called hashing.

hash table:

Hash function are utilized related to Hash table to store and recover data items or information records. The hash function  changes the key related with every data or record into a hash code which is used to index the hash table.

                

//buckets is nothing but the values