Hashing.java

This class shows the use of the three types of open addressing of hash tables, it asks the user to choose which one, linear probing which checks if table is empty sequencially,  Quadratic probing which is it checks if spot if empty and if not it adds 1 space check and then doubles each time (eg x+1, x+2, x+4......), DoubleHashing involves getting a jumpsize from the size of the array and using that to jump different lengths depending on the word.