#include <stdio.h>
 
void recursiveFunction(int val)
{
    // The working area of the function
    printf("called value is %d \n", val);
    val--;                          // decrement val
 
    // The test of the end-value
    // In this simple example it's simply waiting until val becomes 0
    if (val > 0)
    {
        recursiveFunction(val);     // >0 call again
    }
    else
    {
        return;                     // <= 0, done
    }
 
    // Returns will come here and val will be restored to
    //    it's previous value
    // Do the next 'work'
    printf("return value is %d \n", val);
 
    return;
}
 
int main()
{
    recursiveFunction(5);       // start the function off
 
    return 0;
}

#include <iostream>
using namespace std;
 
void spaces(int x) //I'm thinking, everybody else is going to do a diamond full of stars. So why not
//put spaces in mine and show the outline of the shape
{
   for (int c = 1; c <= x; c++)
      cout << " ";//the spaces
}
 
void stars(int x)//the stars
{
   for (int c = 1; c <= x; c++)
 
   {
            cout << "*"; 
         }
 
}
 
void row(int r, int rows) //print out each row
{
   spaces (rows - r);
  stars (1);//outline of diamond
  stars (2 *(r - 1));//fills up inside of daimond.
 
 
   stars(1);
 
   cout << endl;
}
 
void top_row(int rows)  
{
   spaces (rows);
   stars (1);
   cout << endl;
}
 
 
int getDiff(int X, int Y) { // Tail Implementation
  X++; // Inc X
  if (X == Y)
    return 1;
 
  return (1+getDiff(X, Y));
}
 
 
void getDiff2(int X, int Y, int Diff = 0) //subtracting x from y
{
  X++;
  Diff++;
 
  if (X != Y)
    getDiff2(X, Y, Diff);
  else
    cout << "Diff Was: " << Diff << endl;
 
  return;
}
 
int main(void) {
 
 
 
   int r, rows;
   cout << "Size of diamond? ";//input the number
   cin >> rows;
cout << "Difference Between 1 & 7 Is: " << getDiff(1, 7) << endl;//getting the difference between 1 and 7
 
   top_row(rows);
   for (r = 1; r <= rows; r ++) row(r, rows);
   for (r = rows - 1; r >= 1; r --) row (r, rows);//This is where the equation for recursions takes place
   top_row(rows);
 
   return 0; //end program
}