logo CodeStepByStep logo

starString

Language/Type: C++ recursion
Author: Marty Stepp (on 2016/06/16)

Write a recursive function named starString that accepts an integer parameter n and returns a string of stars (asterisks) 2n long (i.e., 2 to the nth power). For example:

Call Returns Reason
starString(0); "*" 20 = 1
starString(1); "**" 21 = 2
starString(2); "****" 22 = 4
starString(3); "********" 23 = 8
starString(4); "****************" 24 = 16

You should throw an integer exception if passed a value less than 0.

Type your solution here:


This is a function problem. Write a C++ function as described. Do not write a complete program; just the function(s) above.

You must log in before you can solve this problem.


Log In

If you do not understand how to solve a problem or why your solution doesn't work, please contact your TA or instructor.
If something seems wrong with the site (errors, slow performance, incorrect problems/tests, etc.), please

Is there a problem? Contact a site administrator.

© Marty Stepp, all rights reserved.