C++ Recursive Function Problem
$10-15 USD
Paid on delivery
A few issues/problems: 1. What (if anything) is wrong with this recursive function? Void DoIt(int N) { if ( N > 0) { cout << N << " "; DoIt(N + 1); } } 2. Consider the language in the alphabet {a, b} defined by the grammar: <s>= a</s>a | b<s>b | a | b a. List all the 5-character strings that are in this language b. Write a recursive function that, when passed a character array S and integers First and Last, determines whether S [First...Last] is in this language. 3. Write a recursive function recursiveMinimum that takes an integer array and the array size as arguments and returns the smallest element of the array. The function should stop calling itself recursively when it receives an array of one element. 4. Consider the function S defined by the following recurrence relation. S(1) = 5; S(N) = S(N-1) + 5 for N > 1 What is the value of S(10)?</s>
## <s>Deliverables</s>
<s>1) Complete and fully-functional working program(s) in executable form (if applicable) as well as complete source code of all work done. 2) Complete ownership and distribution copyrights to all work purchased.</s>
## <s>Platform</s>
<s>Windows</s>
Project ID: #2961409