1.
Using the hash table performance formulas given in the chapter, compute the average number of comparisons necessary when the table is
At what point do you think the hash table is too small? Explain.
"G", "A", "R", "L", "I", "C"
]. Show how this list is sorted using the following algorithms:
size
method for the hash table Map ADT implementation.
containsKey
method for the hash table Map ADT implementation.
removeKey
method for the HashTable
class.
put
method so that the table will automatically resize itself when the loading factor reaches a predetermined value (you can decide the value based on your assessment of load versus performance).
mergeSort
function without using the slice operator.
quickSort
. Run an experiment to compare the two techniques.