This is a program I wrote during my first semester of Lewis-Clark State College in my CS213 class. Create empty list Fill list values with .dat index Use Modulo hashing to convert key to address for each collision use a quadratic or linear solution to re-asign the address prompt user to search using a key Take average of values in user search Find max of list of values for user search