All in C++

Recursion Problems n Chapter 19 you learned about the problem-solving technique called recursion, in which large problems are solved by reducing them to smaller problems of the same form. To solve a recursive problem you use the following template, called the re- cursive paradigm, taking a recursive leap of faith Apply this technique by: Identifying the simple case(s) for which the answer is easily determined. 1. Identifying a simpler problem of the same form 2. Poor Devil of a Sub Sub Complete the function: subCount (str, sub) that recursively computes the number of times that sub appears inside str, without the substrings overlapping. Here are some examples: subCcount (“catcowcat “, “cat”) returns 2 subCount (“catcowcat “, “cow”) returns 1 subCount (“catcowcat”, “dog”) returns 1 2 A substring counting Again, you need to use recursion, not loops to complete your function. If you get stuck, well, you know what to do. Һ33.сpp ҺЗ3.h X 1 /** 1 /* @file h33.h @author Stephen Gilbert version Declarations for CS 150 Homework @file h33.cpp @author your name here @version what day and meeting time 2 2 3 4 4 5 5 6 #include <string> 7 #include <stdexcept> 8 using namespace std; 6 #ifndef H33_H 7 #define H33 H 8 #include <string> 10 #include “h33.h” 10 /** Compute recursively the number of times that sub appears inside str, without the substrings overlapping. 11 11 12 string STUDENT “WHO AM I?”; // Add your Canvas/occ-email ID 12 13 13 14 /Add your implementation here @param str the string to search through. @param sub the string to look for. @return number of times that sub appears in str (without overlap). 14 15 15 16 16 17 17 Here are some examples: subCount (“catcowc at”, “cat”) returns 2 subCount (“catcowc at”, “cow”) returns 1 subCount (“catcowcat”, “dog”) returns 0 18 18 19 // /////!!Student Testing ///// 19 20 #include <iostream> 20 21 int run) 21 22 f 22 cout <“Student testing” << endl; return 0; 23 23 24 int subCount (const std::string& str, const std::string& sub); 24 25 25 26 #endif 26 27 Show transcribed image text Recursion Problems n Chapter 19 you learned about the problem-solving technique called recursion, in which large problems are solved by reducing them to smaller problems of the same form. To solve a recursive problem you use the following template, called the re- cursive paradigm, taking a recursive leap of faith Apply this technique by: Identifying the simple case(s) for which the answer is easily determined. 1. Identifying a simpler problem of the same form 2. Poor Devil of a Sub Sub Complete the function: subCount (str, sub) that recursively computes the number of times that sub appears inside str, without the substrings overlapping. Here are some examples: subCcount (“catcowcat “, “cat”) returns 2 subCount (“catcowcat “, “cow”) returns 1 subCount (“catcowcat”, “dog”) returns 1 2 A substring counting Again, you need to use recursion, not loops to complete your function. If you get stuck, well, you know what to do.

Һ33.сpp ҺЗ3.h X 1 /** 1 /* @file h33.h @author Stephen Gilbert version Declarations for CS 150 Homework @file h33.cpp @author your name here @version what day and meeting time 2 2 3 4 4 5 5 6 #include 7 #include 8 using namespace std; 6 #ifndef H33_H 7 #define H33 H 8 #include 10 #include “h33.h” 10 /** Compute recursively the number of times that sub appears inside str, without the substrings overlapping. 11 11 12 string STUDENT “WHO AM I?”; // Add your Canvas/occ-email ID 12 13 13 14 /Add your implementation here @param str the string to search through. @param sub the string to look for. @return number of times that sub appears in str (without overlap). 14 15 15 16 16 17 17 Here are some examples: subCount (“catcowc at”, “cat”) returns 2 subCount (“catcowc at”, “cow”) returns 1 subCount (“catcowcat”, “dog”) returns 0 18 18 19 // /////!!Student Testing ///// 19 20 #include 20 21 int run) 21 22 f 22 cout

## Expert Answer

Answer to Recursion Problems n Chapter 19 you learned about the problem-solving technique called recursion, in which large problem…