for * it can be like.. for example we have any string say *ab*c*de* it is composed of three strings ..that has to be searched.in that sequece in only..which means..first ab would appear..then c ..then de..
first search for pattern "ab" in string..using pattern matching function.. then search for c in the remaining string(which can be found..using the pointer returned by first) then search for de in the remaining string(which can be found..using the pointer returned by second) the string b/w first and last pointer would be the result.. Correct me if am wrong.. On Sat, Sep 3, 2011 at 12:10 PM, Abhishek Yadav <[email protected]>wrote: > Implement a function that receive a string S and a pattern containing > wild characters ( * and ? only) in string P. Function return true if S > matches the pattern P. > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- *Dheeraj Sharma* Comp Engg. NIT Kurukshetra +91 8950264227 -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
