create a trie with an index number on each node where a name ends.The index number can be the index of the database table where numbers are stored,,,..or they can represent an offset in a file where the numbers are stored.....Possible problem-if a person with the same name has more than one number.in that case we need to store instead of an index number an array of index numbers....... Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com
On Fri, Feb 17, 2012 at 9:25 PM, Devansh Gupta <devanshgupta...@gmail.com>wrote: > Which data structure will be the best one to implement contact list in > mobiles? > TRIE is a good choice but as we search for a name, it shows all possible > names with that prefix. How it can be implemented with TRIE ? > > -- > Thanks and Regards > *Devansh Gupta* > *B.Tech Third Year* > *MNNIT, Allahabad* > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
