I need a liear hashing problem solved.
You will create a java class "linear_hash" that does:
insertion of key
search of key
deletion of key
The matrix will have 100 positions (M=100) and every position has a capacity of 10 keys.
Overflow pages have a capacity of 10 keys
At insertion, when u>= 50% page split
At deletion, page merge at u < 50%
Only contact me if you are an expert in java.
include the word "pen" so I know you are not a robot.
I have read your project and I am an expert in this field. I can do this for you within due time and honestly. I also have a few questions to discuss. Kindly contact me and we will discuss time and budget. Thanks