Comments on: A C++ program to generate a Pascal’s triangle

By: raks

raks — Fri, 18 Dec 2009 03:42:57 +0000

guys..wat abt dis program..
1
1 2
1 2 3
1 2 3 4

By: sanket

sanket — Sat, 31 Oct 2009 14:10:12 +0000

#include
#include

void main()
{
clrscr();
int a[10][11];
int i,j;
for(i=0;i<=9;i++)
{
for(j=0;j<=10;j++)
a[i][j]=0;
}
a[0][1]=1;
for(i=1;i<=9;i++)
{
for(j=1;j<=10;j++)
{
a[i][j]=a[i-1][j-1]+a[i-1][j];
}
}

for(i=0;i=i-5;j–)
cout<<" ";
for(j=1;j<=10;j++)
{
if(a[i][j]!=0)
cout<<" "< }
cout<<"\n";
}
}

By: dayle

dayle — Wed, 21 Oct 2009 10:34:02 +0000

the same consept as above but displayed sideways.., tnx..,

By: dayle

dayle — Wed, 21 Oct 2009 10:33:19 +0000

guys.., how could you display this program like this:

*
*
* *
* *
* * *
* *
* *
*
*

given any value for the row..,

By: Satish Gandham

Satish Gandham — Wed, 08 Jul 2009 05:43:25 +0000

Hello Tom,
Thanks for ur comment, i will post the optimized code very soon.

By: Tom

Tom — Wed, 24 Jun 2009 03:54:45 +0000

That’s really slow, though (exponential in the number of rows you want to output) since you have to keep computing factorials over and over again.

It’s *much* faster to use the fact that each element is the sum of the two above it. This means you need to always store the last row you’ve computed, but that’s not a big deal if you are willing to spend O(n) space.

By: HacK_MiNDeD

HacK_MiNDeD — Sun, 19 Apr 2009 09:20:17 +0000

I needed it…!
Thanks