// there were some mistakes... so...
i=0; char *str; while(a[i]!=NULL) { j=0; while(j!=i) { l=0; for(k=j;k<=i;k++) { str[l]=a[j]; l++ } if(Dictionary.findword(str)) printf(str); j++; } } On Mon, Sep 19, 2011 at 8:44 PM, Yogesh Yadav <medu...@gmail.com> wrote: > i=0; > char *str; > while(a[i]!=NULL) > { > j=0; > > while(j!=i) > { > for(k=j;k<=i;k++) > { > l=0; > str[l]=a[j]; > } > if(Dictionary.findword(str)) > printf(str); > j++; > } > } > > > ... > > On Mon, Sep 19, 2011 at 8:20 PM, 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. >> >> > -- 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.