Answer to Question #261065 in Python for kishan

Question

Implementation of Hash Table with collision resolution techniques

in python with algorithm

Answer 1

# Function to display hashtable 

def display_hash(hashTable): 


      

    for i in range(len(hashTable)): 


        print(i, end = " ") 


          

        for j in hashTable[i]: 


            print("-->", end = " ") 


            print(j, end = " ") 


              

        print() 


  
# Creating Hashtable as  
# a nested list. 

HashTable = [[] for _ in range(10)] 


  
# Hashing Function to return  
# key for every value. 

def Hashing(keyvalue): 


    return keyvalue % len(HashTable) 


  

  
# Insert Function to add 
# values to the hash table 

def insert(Hashtable, keyvalue, value): 


      

    hash_key = Hashing(keyvalue) 


    Hashtable[hash_key].append(value) 


  
# Driver Code 

insert(HashTable, 10, 'Allahabad') 


insert(HashTable, 25, 'Mumbai') 


insert(HashTable, 20, 'Mathura') 


insert(HashTable, 9, 'Delhi') 


insert(HashTable, 21, 'Punjab') 


insert(HashTable, 21, 'Noida') 


  
display_hash (HashTable)