Welcome to Programming and Data Structures

Write a recursive function void printPattern(string s). It will be passed a string of stars (e.g. "****") and should print out a pattern of stars that looks like this:

****
***
**
*

Write a recursive function void printPattern(string s). It will be passed a string of stars (e.g. "****") and should print out a pattern of stars that looks like this:

*
**
***
****

Write a recursive function void printPattern(string s). It will be passed a string of stars (e.g. "****") and should print out a pattern of stars that looks like this:

****
***
**
*
**
***
****

Implement the recursive function: string repeat(string s, int times)

The returned value should be the string s repeated times times. You don’t have to worry about negative values of times. Note that the function header is there, you just need to fill in the body.

Implement a recursive function to turn an integer into a string of binary digits (1s and 0s) string makeBinary(int n)

Use the divide by 2 method to convert decimal to binary (you can refer to Welcome to CS for how the algorithm works).

The logic for converting 13 to binary (1101):

Write a function double investment(double money, double interestRate, int years) that returns the final value of an amount of money invested at a given interest rate for a given number of years.

years will never be negative, but it may be 0.

The interest rate will be given as a percentage (e.g., 5.0 for 5%). Compute simple interest for each year. E.g. Starting with 10000 and an interest rate of 5%, the interest earned for the first year will be 10000 * 0.05 = 500.

Write a function int investmentLength(double money, double goal, double interestRate) that returns the number of years it will take to reach the given investment goal if you start with the given amount of money and invest at the specified interest rate.

The interest rate will be given as a percentage (e.g., 5.0 for 5%). Compute simple interest for each year. E.g. Starting with 10000 and an interest rate of 5%, the interest earned for the first year will be 10000 * 0.05 = 500.

Implement the function: double series(int steps)

This function should return the sum of the first steps number of terms from the series 1 + 1/2 + 1/4 + 1/8 + 1/16....

You can add another parameter. Although you do not have to, it may make the logic easier. If you want to do so, make sure it has a default value or you have a non-recursive version of the function to kick start things.

Implement the function int letterCount(const string& s, char a). It should return the number of times char a appears in s.

If you want to avoid making substrings of s, you can create a recursive helper that the provided letterCount calls.

Write a function int numLegs(const vector<char>& animals, int curPosition = 0). The vector will consist only of the chars ’c’ and ’d’ representing "cow" or "duck". The function should calculate the total number of legs those animals have (assume no mutations or industrial accidents... a cow has 4 and a duck has 2).

Use the changing index strategy.

Implement the function int getMax(const vector<int>&, int curIndex = 0). It should return the largest int in the vector.