Lab: Recursion Fun - TEST YOUR MIGHT!

No loops allowed for this lab:
-no for loops
-no while loops
-no do-while's
-no while-do's
-no for-while's
-no while-for-do's

#1: Write a method ‘void lineOfStars(int n)’ that prints a line of n stars.  You may not use a loop.

lineOfStars(5);  //   should display: *****

 
#2: Write a method ‘void stars(int n)’ that prints the weird shape below.  You may not use a loop.  You may call ‘lineOfStars’ as a subroutine.

stars(4);

should display:

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


#3: Write a recursive function ‘int numOnes(int n)’ that returns the number of 1's in the binary expansion of n.

cout << numOnes(5325) << endl;   //should display 7, because 5325 is 1010011001101 in binary.

#4: Write a recursive function ‘bool palindrome(string s)’ that returns true if s is a palindrome and false if not.


#5: Write a recursive function 'void reverse(string &word)' that reverses the given input string.

string name = "robbie";
reverse(name);
cout << name << endl;  //should display "eibbor".

#6: Write a function 'string binary(int n)' that returns a string of 1's and 0's which is the binary representation of n.

cout << binary(43) << endl; // 101011

#7: Write a function 'int numTwos(int n)' which returns the number of 2's in the base-4 expansion of n.

cout << numTwos(2170) << endl; // 3