All categories

2 years ago

write a recursive bool valued function containsvowel that accepts a string and returns true if the string contains a vowel

Computers and Technology

1 answer:

zhannawk [14.2K]2 years ago

7 0

Answer:

Write a recursive, bool-valued function, containsVowel, that accepts a string and returns true if the string contains a vowel. A string contains a vowel if: The first character of the string is a v…

Explanation:

bool containsVowel (string s) { bool hasVowel=false; if (s.length()==0) return false; else if (s[0]=='a'|| s[0]=='e'|| s[0]=='u'|| s[0]=='o'|| s[0]=='i'|| s[0]=='A'|| s[0]=='E'|| s[0]=='U'|| s[0]=='O'|| s[0]=='

You might be interested in

Which of the following operating systems would allow a user to add functionality and sell or give away their versions?

olchik [2.2K]

Answer:open source

Explanation: what is's called

4 0

2 years ago

A working model of a new product for testing purposes.

kotykmax [81]

Prototype is a working model for a product only for testing purposes

6 0

3 years ago

What is the abuse of electronic messaging systems to indiscriminately send unsolicited bulk messages, many of which contain hoax

Ilya [14]

I think the answer is spam

5 0

2 years ago

A real estate office handles 50 apartment units. When the rent is $600 per month, all the units are occupied. However, for each

Vesnalui [34]

Answer:

452

Explanation:

7 0

3 years ago

given an array of integers a, your task is to count the number of pairs i and j (where 0 ≤ i < j < a.length), such that a[

Nimfa-mama [501]

Using the knowledge of computational language in C++ it is possible to write a code that given an array of integers a, your task is to count the number of pairs i and j.

<h3>Writting the code:</h3>

// C++ program for the above approach

#include <bits/stdc++.h>

using namespace std;

// Function to find the count required pairs

void getPairs(int arr[], int N, int K)

{

// Stores count of pairs

int count = 0;

// Traverse the array

for (int i = 0; i < N; i++) {

for (int j = i + 1; j < N; j++) {

// Check if the condition

// is satisfied or not

if (arr[i] > K * arr[j])

count++;

}

cout << count;

}

// Driver Code

int main()

{

int arr[] = { 5, 6, 2, 5 };

int N = sizeof(arr) / sizeof(arr[0]);

int K = 2;

// Function Call

getPairs(arr, N, K);

return 0;

}

See more about C++ code at brainly.com/question/17544466

#SPJ4

4 0

1 year ago