Welcome to Programming and Data Structures

Implement the recursive function: int power(int x, int p)

The returned value should be x to the p power. You don’t have to worry about negative exponents. Note that the function header is there, you just need to fill in the body.

Write a function int investmentLength(double money, double goal, double interestRate) that returns the time it will take to reach the given goal if you start with the given amount of money and invest at the specified interest rate. (Interest rate will be a %, divide by 100.0 before using).

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):

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....

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.