Consider a frame of bowling pins where each * represents a pin: There are five r

Question

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 then there would be a total of 10 pins. If we had only the top three rows then there would be a total of 6 pins. If we had only the top two rows then there would be a total of 3 pins. If we had only the top row then there would be a total of 1 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.

**** also needed to be written in c++ ***** thank you

Example below:

 

   *

  **

 ***

 ****

*****

Explanation / Answer

I for got about the library which is used in making of pyramid of * .The code below make a triangle recurssively. #include #include using namespace ::std; int pyramid(int n) { int i; if(n == 0) return n; else { pyramid(--n); for(i=0;i

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.