Introduction - If you have any usage issues, please Google them yourself
1. Define the hash table data structure. 2. In addition to leaving the remainder as the hash function method, H (key) = key P re-hashing with linear probing methods of conflict resolution, write a function to achieve the hash table build process, and output the hash table. 3. Write function, seeking to find the average successful search length (ASL).