Assuming that findword is O(n) for words of size n, this will be an O(n^3) algorithm. If you had a better interface to the dictionary, it could be O(n). That's another example of why interfaces should be designed for the intended task.
Don On Sep 19, 9:50 am, Sangeeta <sangeeta15...@gmail.com> wrote: > given an array of characters without spaces and a dictionary.All valid > dictionary words must be found and printed. > i/p : BANKERKCATXYWOMAN. > o/p: BANK > BANKER > CAT > WOMAN > MAN > (the only function you could use for dictionary is > dictionary.findword(char *str) which returns a Boolean value). > Eg. Dictionary.findword(“bank”) =>true > Dictionary.findword(“hj”) =>false -- 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.
