Hashing

  • Dictionary
    • Will be stored in Hash Table
  • Spell Checker
    • Matching will be done by exact match.

  • Disadvantage
    • Does not support prefix search, where a user types a prefix and your dictionary shows all words starting with that prefix.

    • Doesn’t support efficient printing of all words in the dictionary in alphabetical order and nearest neighbor search.
  • Complexity
    • Seach - O(n)