Different Data Structures Used For Playing With Anagram

Abstract

In this paper, we are presenting afyndamentals of data structure, explains what exactly is the anagram . Then
different Data Structures used for Anagram. Comparing them with each other. Explains the data structure which stores the
given dictionary data in a hash table called PRIME by usingfundamental theorem on Arithmetic to generate a key for each
dictionary word, and stores the word in the hash table based on the key. Ascompared to tree -based techniques PRIME table
generates anagram for the given random word in O(1) time, time to construct a PRIME tabled epends on the number of words
in the dictionary. If dictionary has „n‟words then the time to develop the PRIME table is O(n).