Arrays

Question

Making a pascal triangle using array and without using array in turbo c.... Can't able to figure it outplease me... ---Posted from iPhone App---

Vulpes · Answer

Using arrays the C# code would be: using System; class Pascal { static void Main() { Console.Write(Input number of rows to generate (1 to 17) : ); int n; int.TryParse(Console.ReadLine() out n); if (n { Console.WriteLine(Can't be less than one!); return; } else if (n > 17) { Console.WriteLine(Too big to display on console!); return; } int[][] rows = new int[n][]; for(int i = 0; i { rows[i] = new int[i + 1]; rows[i][0] = 1; if (i > 0) rows[i][i] = 1; if (i > 1) { for(int j = 1; j { rows[i][j] = rows[i-1][j-1] + rows[i-1][j]; } } } Console.Clear(); int totalLen = n - 1; for(int i = 0; i for(int i = 0; i { int currLen = i; for(int j = 0; j int offset = (totalLen - currLen) / 2; Console.Write(new string(' ' offset)); for(int j = 0; j Console.WriteLine(); } Console.ReadKey(); } } Without using arrays (i.e. using the binomial coefficients instead) the code would be: using System; class Pascal2 { static void Main() { Console.Write(Input number of rows to generate (1 to 17) : ); int n; int.TryParse(Console.ReadLine() out n); if (n { Console.WriteLine(Can't be less than one!); return; } else if (n > 17) { Console.WriteLine(Too big to display on console!); return; } Console.Clear(); for(int i = 0; i { for(int j = 0; j { int k = i - j; long coeff = Factorial(i)/Factorial(j)/Factorial(k); Console.Write({0}  coeff); } Console.WriteLine(); } Console.ReadKey(); } static long Factorial(int n) { if (n return n * Factorial(n - 1); } } In this second case you can only really display the numbers as a right-angled rather than an equilateral triangle as you don't know how long each line will be until you've generated the numbers.