Please write in c++, and use the recursion to solve this problem, thanks in advance! For this assignment, you will write a function that takes two strings. int findDistributedString(string haystack, string needle);and returns the number of times that needle appears in haystack. The characters in needle must appear in the right order in the haystack string, but they do not have to appear side-byside. For example, if haystack is "call me Ishmael" and needle is "meal", your function should return 1, because "meal" appears in "call me Ishmael" once: call me Ishmael

please use python and the .isdigit() function if possible. thank you so much

Complete the function ratio_similarity, which computes the ratio of "similarity" between two non-empty strings. The ratio is computed as follows: 2 (the number of matches of characters) / (total number of characters in both strings) The matches are determined in pairwise fashion. For example, consider the strings abcdef and abdce. The three characters at indexes 0, 1 and 4 match. Therefore, the similarity ratio is 2 * 3/(6 + 5) = 0.5454 .... Examples: Function Call string_similarity('abcdef', 'abdce') string_similarity('dragon', 'flagon') string_similarity('stony', 'stony') string_similarity('Stony Brook University', 'WolfieNet Secure') string_similarity('yabba dabba doo', 'bippity boppity boo') string_similarity('Wolfie the Seawolf', "What's...a Seawolf?") [ ] Return Value 3 4 5 # Test cases 6 print (string_similarity('abcdef', 'abdce')) 7 print (string_similarity('dragon' 1 'flagon')) 'stony')) 0.5454545454545454 0.6666666666666666 1.0 0.0 0.058823529411764705 0.4864864864864865 1...

2. Write the definition of a bool function named BooleanMode () whose header is bool BooleanMode (bool data[), int n) Given that n represents the size of data, the function returns the truth value that appears the most in data. If there is an equal number of both truth values in data, the function returns the truth value that appeared first. For instance, if data = [true, true,false, false,false, true,falsel, then the function will return false. Impl

Need python help. For problems 1 and 2, add your code to the file Lab2.java. Add your tests in the main function of Lab2.java. Do not use static variables in class Lab2 to implement recursive methods. Problem 1: Implement a recursive method min that accepts an array and returns the minimum element in the array. The recursive step should divide the array into two halves and find the minimum in each half. The program should run in O(n) time and consume O(logn) memory. Demonstrate the output of min on the array int [] a = { 2, 3, 5, 7, 11, 13, 17, 19, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 23, 29, 31, 37, 41, 43 } Problem 2 You have been offered a job that pays as follows: On the first day, you are paid 1 cent, on the second day, 2 cents, on the third day, 4 cents and so on. In other words, your pay doubles every day. Write a recursive method computePay that for a given day number computes the pay in cents. Assume that you accumulate all the money that you are paid. Write a...

In c++

PLease! in c++ Write a function named "getNonNegativeSum" that takes in 4 input parameters: -a pointer to thearray of integers-its size, -the index tostart the sum from -the count of how many numbers from that starting index It will return the sum of all values from the startingindex with the number count of how many. It will add to the sum if the number in the array is positiveand skip all negative values. If there is an error in the indexor not enough numbers to count, it will return -1. For example,int numList[] = {10, 20, -1, 30}; If the starting index is 1 and the count of 3, it will return 50 If the starting index is 2 and the count of 2, it will return 30 If the starting index is -1 and the count of 2, it will return -1 If the starting index is 2and the count of 5, it will return -1.int priceList[] = {10, 20, 30, -1, 40}; If the starting index is 0, and the count is 1, it will return 10 If the starting index is 1, and the count is 3, itwill return 50 If the starting index is 0,...

The goal is to rewrite the function, below, such that passes in a different list of parameters, particularly eliminating the need to pass low and high for each recursive call to binary_search. defbinary_search(nums,low,high,item): mid=(low+high)//2iflow>high:returnFalse #The item doesn't exist in the list!elifnums[mid]==item:returnTrue# The item exists in the list!elifitem<nums[mid]:returnbinary_search(nums,low,mid-1,item)else:returnbinary_search(nums,mid+1,high,item) The new function should be prototyped below. The number of changes between the given version, and the one requested is not significant. defbinary_search(nums,item):pass# Remove this and fill in with your code Tip: If you consider that high and low are used to create a smaller version of our problem to be processed recursively, the version requested will do the same thing, just through a different, more Pythonic technique.

The function find_max_char takes one string parameter, mystr. The function returns the character in mystr with the maximum ordinal value (the character that comes last in the ASCII alphabet, relative to the other characters in mystr). However, if mystr is the empty string, the function returns the Python object None. Notice that we don't need the ord() function to compare ordinal values; we can use comparison operators. For example, "Z" > "C" is true because Z comes after C in the ASCII alphabet. We need to "accumulate" the correct answer (max_char) and then return it: First, if mystr is empty, return None Then initialize max_char (accumulator variable) to the first character in mystr Use a for loop to iterate ch over the characters in mystr Each time a new maximum character is found (if ch > max_char), max_char is updated to "remember" that the new maximum is ch Finally, return max_char For example: Test Result print(find_max_char("naproxen")) x...

Implement a function, countVowels, which takes in a string and counts the number of vowels that are contained within it. Make sure that both capital vowels and lowercase vowels are counted. Your starter code contains a main function, which asks for user input and outputs the number of vowels. You will need to implement the user input for the string. Sample Runs (user input is italicized and underlined): Enter a phrase: Hello World!Number of vowels: 3 Enter a phrase: PROGRAMMING IS EXCELLENT.Number of vowels: 7 #include <string>#include <iostream>using namespace std; int countVowels(string word); int main(){ string phrase; cout << "Enter a phrase: "; // To do: implement user input cout << "Number of vowels: " << countVowels(phrase) << endl;} // To do: Implement countVowels int countVowels(string word){}

Write a python function called replacer() that takes two strings as arguments. Argument1: A sentence where you have to make the changes. Argument2: A word with the values either "vowel" or "consonant".Your function should replace the characters of the sentence with "V" or "C" depending on the 2nd argument. If the word is "vowel", then replace all the vowels with "V". If the word is "consonant", then replace all the consonants with "C".[You are not allowed to use the replace() function]Function call1:replacer("It is MAT110 final", "vowels")Sample Output1:Vt Vs MVT110 fVnVlFunction call2:replacer("It is CSE110 final", "consonants")Sample Output 02:IC iC CCE110 CiCaC

Use Java

do it in c++ i need it fast in 10 minutes