Hash Tables Homework Help
- Another essential as well as widely useful technique for applying dictionaries.
- Constant time for each operation (on the average)
- Worst case time proportional in order to the size of the set for each operation (the same as an array and chain implementation)
Example,
- Dictionary Student Records
- Keys are ID numbers (951000 - 952000), no more than 100 students
- Hash function: h(k) = k-951000 maps ID into distinct table positions 0-1000
- Array table[1001]
