Skip to content

Implementation of hashtable using an array and a linked list so we are using separte chaining for colition resolution

Notifications You must be signed in to change notification settings

jose-rafael-marcano/MyHashTable

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 
 
 

Repository files navigation

MyHashTable

Added junit with AssertJ to test the hashtable methods. Using direct chaining with the linked list for collision resolution technique.

Using recursion in the MaxSum, calling recursive function for row=0, column=1 and for row=1,column=1 and row 1,column=0, the use the max of the 3 recursions, the rest of the cells are traversed recursively using the 8 rule positions when is possible.

About

Implementation of hashtable using an array and a linked list so we are using separte chaining for colition resolution

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages