Introduction - If you have any usage issues, please Google them yourself
Set the hash function H (key) = key MOD 11 (table length =11), input a set of keyword sequences, set up the hash table storage structure based on the method of linear detection re hash resolving conflicts, display the hash table, enter the keyword arbitrarily, and judge whether it is in the hash table.