yep, trie needs to be built On Aug 24, 10:49 pm, Ankur Garg <ankurga...@gmail.com> wrote: > It means when u call that func u get the next word in the document > > Regards > Ankur > > > > > > > > On Wed, Aug 24, 2011 at 6:59 PM, vikas <vikas.rastogi2...@gmail.com> wrote: > > what do you mean by "a function for finding the next word is given" ? > > > On Aug 22, 1:56 am, Ankur Garg <ankurga...@gmail.com> wrote: > > > Question--> Given a document containing some words ...and a function > > > for finding the next word is given .....design a code which efficiently > > search > > > the word and find occurrence of it in given document . > > > > -which data structure will be used? > > > > -write algorithm for implementing complexity? > > > > Guys any Ideas here .. I think tries can be used but can anyone > > > explain/suggest/discuss proper implementation /technique to solve this > > > problem > > > > Regards > > > > Ankur > > > -- > > 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.
