Consider a frame of bowling pins, where each * represents a pin:
*
* *
* * *
* * * *
* * * * *
There are five rows and a total of fifteen pins. If we had only the top four rows, there would be a total of ten pins. If we had only the top three rows, there would be a total of six pins. If we had only the top two rows, there would be a total of three pins. If we had only the top row, there would be a total of one pin.
Write a recursive function that takes as input the number of rows, n , and outputs the total number of pins that would exist in a pyramid with n rows. Your program should allow for values of n that are larger than 5.
Sorry the answer is not available at the moment…
If you are able to find the answer, please make sure to post it here. So that your Juniors have smile on their lips and feel happy.
Spread the 'tradition of sharing'.