Different Data Structures Used For Playing With Anagram
| Author(s) | : | JinalPatel |
| Institution | : | Computer And Science Department,Saffrony Institute of Technology ,Linch,Mehsana |
| Published In | : | Vol. 2, Issue 5 — May 2015 |
| Page No. | : | 243-249 |
| Domain | : | Engineering |
| Type | : | Research Paper |
| ISSN (Online) | : | 2348-4470 |
| ISSN (Print) | : | 2348-6406 |
In this paper, we are presenting afyndamentals of data structure, explains what exactly is the anagram . Thendifferent Data Structures used for Anagram. Comparing them with each other. Explains the data structure which stores thegiven dictionary data in a hash table called PRIME by usingfundamental theorem on Arithmetic to generate a key for eachdictionary word, and stores the word in the hash table based on the key. Ascompared to tree -based techniques PRIME tablegenerates anagram for the given random word in O(1) time, time to construct a PRIME tabled epends on the number of wordsin the dictionary. If dictionary has „n‟words then the time to develop the PRIME table is O(n).
JinalPatel, “Different Data Structures Used For Playing With Anagram”, International Journal of Advance Engineering and Research Development (IJAERD), Vol. 2, Issue 5, pp. 243-249, May 2015.
