logo CodeStepByStep logo

starString

Language/Type: Java recursion
Related Links:

Write a recursive method 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 IllegalArgumentException if passed a value less than 0.

Method: Write a Java method as described, not a complete program or class.

You must log in before you can solve this problem.

Log In

Need help?

Stuck on an exercise? Contact your TA or instructor.

If something seems wrong with our site, please

Is there a problem? Contact us.