Triangle of Pascal

[J Ivan P Silvestre]

c #: Implementing the method Int [,] TrianglePascal (int n) which
returns the triangle to

the level of Pascal N.
public static int[,] TrianglePascal(int n)
{
int[,] arr = new int[n+1,n+1];
for(int i=0;i<n+1;i++)
{
for(int k=0;k<n+1;k++)
{
if(k==0)
arr[i,k]=1;
else if(i==k)arr[i,k]=1;
}
}
for(int i=0;i<n+1;i++)
{
for(int k=0;k<n+1+1;k++){
if(i>=1&&i+1<n+1&&k+1<n+1)
{
if(arr[i,k]!=0&&arr[i,k+1]!=0)
arr[i+1,k+1]=arr[i,k]+arr[i,k+1];
}
}
}
return arr;
}

[Ignacio Machin ( .NET/ C# MVP )]

On Sep 8, 2:03*pm, J Ivan P Silvestre <[e-mail]:

c #: Implementing the method Int [,] TrianglePascal (int n) which
returns the triangle to

the level of Pascal N.

* * * public static int[,] TrianglePascal(int n)
* * * {
* * * * *int[,] arr = new int[n+1,n+1];
* * * * *for(int i=0;i<n+1;i++)
* * * * *{
* * * * * * for(int k=0;k<n+1;k++)
* * * * * * {
* * * * * * if(k==0)
* * * * * * arr[i,k]=1;
* * * * * * *else if(i==k)arr[i,k]=1;
* * * * * * *}
* * * * *}
* * * * *for(int i=0;i<n+1;i++)
* * * * *{
* * * * *for(int k=0;k<n+1+1;k++){
* * * * * * * *if(i>=1&&i+1<n+1&&k+1<n+1)
* * * * * * * *{
* * * * * * * * * if(arr[i,k]!=0&&arr[i,k+1]!=0)
* * * * * * * * * arr[i+1,k+1]=arr[i,k]+arr[i,k+1];
* * * * * * * *}
* * * * * * }
* * * * * *}
* * * * * * return arr;
* * * }

Thank for posting your code

Where is the question though?

[Family Tree Mike]

I like this way:

public static int[,] TP2(int n)
{
int[,] arr = new int[n + 1, n + 1];
for (int r = 0; r < n + 1; ++r)
{
arr[r, 0] = 1;
arr[r, r] = 1;
if (r 0)
{
for (int c = 1; c < n; ++c)
arr[r, c] = arr[r - 1, c - 1] + arr[r - 1, c];
}
}
return arr;
}
"J Ivan P Silvestre" <EC*****@gmail.comwrote in message
news:b8**********************************@k36g2000 pri.googlegroups.com...

>c #: Implementing the method Int [,] TrianglePascal (int n) which
returns the triangle to

the level of Pascal N.
public static int[,] TrianglePascal(int n)
{
int[,] arr = new int[n+1,n+1];
for(int i=0;i<n+1;i++)
{
for(int k=0;k<n+1;k++)
{
if(k==0)
arr[i,k]=1;
else if(i==k)arr[i,k]=1;
}
}
for(int i=0;i<n+1;i++)
{
for(int k=0;k<n+1+1;k++){
if(i>=1&&i+1<n+1&&k+1<n+1)
{
if(arr[i,k]!=0&&arr[i,k+1]!=0)
arr[i+1,k+1]=arr[i,k]+arr[i,k+1];
}
}
}
return arr;
}