Prashanth Rao's repositories
SpellChecker
Implemented a spell-checker using the hash table data structure. All the words were hashed into the hash table using: 1. Linear probing first, and then 2. Quadratic probing The number of collisions are counted in each case. The table size was made to increase automatically based on the load factor. A search function was implemented which searches for any word in the list of words that were hashed.
Language:C++000