Input Assumptions:

• Inputs or keys for hash tables are non-negative integers
• Keys are not allowed to be duplicated

• Insert a key: enter a non-negative integer in the text field, and click Insert button.
• Delete a key: enter a non-negative integer in the text field, and click Delete button.
• Search for a key: enter a non-negative integer in the text field, and click Search button.
• Reset: click Reset button will reset the hash table to be empty.
• Demonstrate: click Demo button will start a demonstration.
• Choose hash algorithms: click and select hash algorithm will set algorithm to be Chaining Hash or Open Addressing Hash.
• Animation speed: slow and fast speeds are available.