Pascal triangle using recursion.

[Manav Mnv]

Hi! I have written this program for Pascal's Triangle using recursion but I m not sure whether it can be termed as 'Recursion' coz it still uses loops , I have basically used the runtime stack but just a bit confused whether the program can be termed as a recusive program or not? Thanks in advance!!

#include<iostream.h>
Using namespace std;

PrintPascal(int a)
{
if (a==1)
cout<<a<<endl;

else
{
PrintPascal(a-1);

for(int i=1; i<=a; i++)
cout<<i<<" ";

for(int z=(a-1); z>0; z--)
cout<<z<<" ";

cout<<endl;
}
}
int main()
{
int n;
cout<<"Enter Number of Rows : ";
cin>>n;

PrintPascal(n);
return 0;
}

[keskiverto]

The function calls itself and there is an end condition that will stop the recursion, so it is recursive. However, does it produce the correct output?

It does differ from algorithms that a websearch for "Pascal's triangle recursion" does return.

[Manav Mnv]

Yes it gives the right output. Thanks!