Given a text txt and a pattern pat, write a recursive function “contains(char pat, char txt)” that returns true if pat is present in txt, otherwise false.
1) Input: txt = "THIS IS A TEST TEXT" pat = "TEST" Output: true 2) Input: txt = "geeksforgeeks" pat = "quiz" Output: false;
We strongly recommend to minimize the browser and try this yourself first.
Below is recursive algorithm.
contains(tex, pat) 1) If the current character is the last character of the text, but pat has more characters, return false. 2) Else If the current character is the last character of the pattern, then return true 3) Else If current characters of pat and text match, then return contains(text + 1, pat + 1); 4) Else If current characters of pat and text don't match return contains(text + 1, pat);
Below is the implementation of the above algorithm.
1 0 1
This article is contributed by Bhupinder. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready. To complete your preparation from learning a language to DS Algo and many more, please refer Complete Interview Preparation Course.
In case you wish to attend live classes with industry experts, please refer DSA Live Classes