@Sagar: for 1 i need implementation of hash function please. for 2, any other suggestion? other than trie? because they are memory intensive.
On Jul 18, 1:18 am, sagar pareek <sagarpar...@gmail.com> wrote: > 1. you can use hash function with link list. > 2. u can use trie with link list. > > > > > > On Mon, Jul 18, 2011 at 1:43 AM, Dumanshu <duman...@gmail.com> wrote: > > I want to have an in-memory dictionary. One word can have multiple > > meanings. > > > 1. If you want to go with hash tables then do Suggest some good > > choices for hash functions. > > 2. Also, how can you modify this dictionary so that it can be used to > > solve a crossword puzzle? > > > -- > > 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. > > -- > **Regards > SAGAR PAREEK > COMPUTER SCIENCE AND ENGINEERING > NIT ALLAHABAD- Hide quoted text - > > - Show quoted text - -- 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.
