Program code: // Recursive C++ program to count the total // number of vowels using recursion #include<cstdlib> #include<iostream> using namespace std; // Function to check the Vowel bool isVowel ( char ch) { // make the letter upper case ch = toupper(ch); // check the vowels return (ch=='A' || ch=='E' || ch=='I' || ch=='O' || ch=='U'); } // to count total number of vowel from 0 to n int countVovels (string str, int n) { //if n is equal to 1 if (n == 1 ) //return the value return isVowel(str[n- 1 ]); //call the function countVovels return countVovels(str, n- 1 ) + isVowel(str[n- 1 ]); } // Main Calling Function int main () { // string object string str = "abcde"; //get the length of the string int len; len=str.size(); //call the method countVovels() int v=countVovels(str, str.length()); int c; // Total numbers of Vowel cout << "no of vowels"<<countVovels(str, str...

Question

Please no AI! Or if you do use AI, Check the work please! Thank you!

Answer 1

Expert Solution & Answer

Chapter 3, Problem 21C

Explanation of Solution

Program code:

// Recursive C++ program to count the total

// number of vowels using recursion

#include<cstdlib>

#include<iostream>

using namespace std;

// Function to check the Vowel

bool isVowel(char ch)

{

// make the letter upper case

ch = toupper(ch);

// check the vowels

return (ch=='A' || ch=='E' || ch=='I' ||

ch=='O' || ch=='U');

}

// to count total number of vowel from 0 to n

int countVovels(string str, int n)

{

//if n is equal to 1

if (n == 1)

//return the value

return isVowel(str[n-1]);

//call the function countVovels

return countVovels(str, n-1) + isVowel(str[n-1]);

}

// Main Calling Function

int main()

{

// string object

string str = "abcde";

//get the length of the string

int len;

len=str.size();

//call the method countVovels()

int v=countVovels(str, str.length());

int c;

// Total numbers of Vowel

cout << "no of vowels"<<countVovels(str, str...

Expert Solution & Answer

Trending nowThis is a popular solution!

See solution

Check out sample textbook solution

Students have asked these similar questions

Please no AI! Or if you do use AI, Check the work please! Thank you!

(Dynamic Programming.) Recall the problem presented in Assign- ment 3 where given a list L of n ordered integers you're tasked with removing m of them such that the distance between the closest two remaining integers is maxi- mized. See Assignment 1 for further clarification and examples. As it turns out there is no (known) greedy algorithm to solve this problem. However, there is a dynamic programming solution. Devise a dynamic programming solution which determines the maximum distance between the closest two points after removing m numbers. Note, it doesn't need to return the resulting list itself. Hint 1: Your sub-problems should be of the form S(i, j), where S(i, j) returns the maximum distance of the closest two numbers when only considering removing j of the first i numbers in L. As an example if L [3, 4, 6, 8, 9, 12, 13, 15], then S(4, 1) = 2, since the closest two values of L' = [3,4,6,8] are 6 and 8 after removing 4 (note, 8-6 = = 2). = Hint 2: For the sub-problem S(i, j),…

(Dynamic Programming.) A group of friends is visiting a number of attractions located along a highway, starting at kilometre 0, placed at distances ɑ1 < A2 < ···