2) Write the definition of a recursive function named find that is passed a c-string and a char and returns with the pos of the char if it finds the char within thec-string or returns -1 if the char is not found. You must implement the expected function, but you may write other code as long as your additional code helps find perform as expected. For example, if a cstring named cstr contains the value "this is my string" and a char named c containing the value 'i' is passed in to find, the function should return the value 2. However, if c contained the value 'a', then find would return -1. This is what the function call for the example above would look like: int foundat = find(cstr, c); NOTE: This function takes a c-string, NOT a string. No c-string functions may be invoked.

2) Write the definition of a recursive function named find that is passed a c-string and a char and returns with the pos of the char if it finds the char within thec-string or returns -1 if the char is not found. You must implement the expected function, but you may write other code as long as your additional code helps find perform as expected. For example, if a cstring named cstr contains the value "this is my string" and a char named c containing the value 'i' is passed in to find, the function should return the value 2. However, if c contained the value 'a', then find would return -1. This is what the function call for the example above would look like: int foundat = find(cstr, c); NOTE: This function takes a c-string, NOT a string. No c-string functions may be invoked.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 8SA

See similar textbooks

Similar questions

Need help with this c++ problem Write a recursive function named lettersOnly that accepts a string str as a parameter and returns a string with the same characters as str, in the same order, but excluding any characters that are not alphabetic letters from A-Z, case-insensitive. For example, lettersOnly("{[[Friends, save $$$ with 'Geico'!!]]}") should return "FriendssavewithGeico".
Create a recursive function that multiplies two positive integers without the need of the * (or /) operator. You can utilise addition, subtraction, and bit shifting, but you should keep the amount of operations to a minimum.
Write a C++ recursive function PrintPattern3 to print following pattern using recursion. No loops allowed whatsoever, and you can write maximum two functions apart from main function. For example, calling your function with these argument PrintPattern1(1,5) should print following pattern. Your function prototype must be as follows recursive function.void PrintPattern3(int start, int end);
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", yourfunction should return 1, because "meal" appears in "call me Ishmael" once: call me Ishmael
Write a recursive C function that returns the uppercase letters of the string named str by storing them in the cap variable. The prototype of the function should be: void F (char * str, * char cap); we use devC ASAP
c++ Write a recursive function that, given two strings, returns whether the first string is asubsequence of the second. For example, given hac and cathartic, you should return true, but givenbat and table, you should return false.
In Kotlin, Write a higher-order function that takes two arguments and returns a String. The first argument is a String and the second is a function that takes a Char and returns a Boolean. Your function should return a String containing those of the characters in the original String for which the function returns true. Use a tail-recursive helper function. Remember to make sure you get the tail recursion right by using the tailrec annotation. Test the function
Need help with this c++ recursive function: Write the function starCrossed() which computes (recursively, with no loops) a new string where identical characters that are adjacent in the original string are separated from each other by a "*". Here are some examples: starCrossed("hello") returns "hel*lo" starCrossed("xxyy") returns "x*xy*y" starCrossed("aaaa") returns "a*a*a*a"
Question: First write a function mulByDigit :: Int -> BigInt -> BigInt which takes an integer digit and a big integer, and returns the big integer list which is the result of multiplying the big integer with the digit. You should get the following behavior: ghci> mulByDigit 9 [9,9,9,9] [8,9,9,9,1] Your implementation should not be recursive. Now, using mulByDigit, fill in the implementation of bigMul :: BigInt -> BigInt -> BigInt Again, you have to fill in implementations for f , base , args only. Once you are done, you should get the following behavior at the prompt: ghci> bigMul [9,9,9,9] [9,9,9,9] [9,9,9,8,0,0,0,1] ghci> bigMul [9,9,9,9,9] [9,9,9,9,9] [9,9,9,9,8,0,0,0,0,1] ghci> bigMul [4,3,7,2] [1,6,3,2,9] [7,1,3,9,0,3,8,8] ghci> bigMul [9,9,9,9] [0] [] Your implementation should not be recursive. Code: import Prelude hiding (replicate, sum)import Data.List (foldl') foldLeft :: (a -> b -> a) -> a -> [b] -> afoldLeft =…
C++ //#4: Write a recursive function ‘bool palindrome(string s)’ that returns true if s is a palindrome and false if not.
Write a recursive findSum function which returns the sum of all integers between (and including) two integers given as parametrs. Write a C program that tests function findSum. (Your function must be recursive.) (Examples: findSum(13, 47) returns 1050, findSum(-2, 89) returns 4002)
3. A palindrome is a sentence that contains the same sequence of letters read-ing it either forwards or backwards. A classic example is "Able was I, ere I saw Elba." Write a recursive function that detects whether a string is a palindrome. The basic idea is to check that the first and last letters of the string are the same letter; if they are, then the entire string is a palindrome if everything between those letters is a palindrome. There are a couple of special cases to check for. If either the first or last character of the string is not a letter, you can check to see if the rest of the string is a palindrome with that character removed. Also, when you compare letters, make sure that you do it in a case-insensitive way. Use your function in a program that prompts a user for a phrase and then tells whether or not it is a palindrome. Here's another classic for testing: "A man, a plan, a canal, Panama!"