Instructions: As in linear.sb but using 3A on page 55. Documentation: The hash function is obtained by summing the digits of the number and taking the lowest digit. This gives a bin number and a linear search in the bin finds the number. The file "hash-table.txt" contains the size of each bin and is imported into the list "hash-table". Variables: As before with the addition of "hash" which is used to store the sum of the digits of "number"; "digit" and "temp" are used to decompose the value of "hash" in order to sum its digits and "temp" is reused as an index into the list "hash-table" to find the correct bin.
