figure the hash workshop applet at startup for the initial array size of this is arrayindex key this hash function is simple enough that you can solve it mentally for given keykeep subtracting until you get number less than for exampleto hash subtract giving and then againgiving this is the index number where the algorithm will place thusyou can easily check that the algorithm has hashed key to the correct address (an array size of is even easier to figure outas key' last digit is the index it will hash to as with other appletsoperations are carried out by repeatedly pressing the same button for exampleto find data item with specified numberclick the find button repeatedly rememberfinish sequence with one button before using another button for exampledon' switch from clicking fill to some other button until the press any key message is displayed all the operations require you to type numerical value at the beginning of the sequence the find button requires you to type key valuefor examplewhile new requires the size of the new table the new button you can create new hash table of size you specify by using the new button the maximum size is this limitation results from the number of cells that can be viewed in the applet window the initial size is also we use this number because it makes it easy to check whether the hash values are correctbut as we'll see laterin general-purpose hash tablethe array size should be prime numberso would be better choice