A Fast Data Structure for Anagrams

Abstract

In this paper, we are presenting a data structure, which stores the given dictionary data in a hash table called PRIME , by using fundamental theorem on Arithmetic to generate a key for each dictionary word, and stores the word in the hash table based on the key. As compared to tree-based techniques PRIME table generates anagram for the given random word in O(1) time, time to construct a PRIME table depends on the number of words in the dictionary. If dictionary has ‘n’ words then the time to develop the PRIME table is O(n). Categories and Subject descriptors: Problem solving, search and control methods.