Anonymous user
Pascal's triangle: Difference between revisions
Add header for GW-BASIC
(→{{header|C}}: recursive method) |
(Add header for GW-BASIC) |
||
Line 607:
END SUBROUTINE Print_Triangle</lang>
=={{header|GAP}}==
<lang gap>Pascal := function(n)
Line 711 ⟶ 712:
15: 1 14 91 364 1001 2002 3003 3432 3003 2002 1001 364 91 14 1 </pre>
=={{header|
<lang qbasic>10 CLS
20 INPUT "Number of rows? ", rows:GOSUB 40
30 END
40 FOR i=0 TO rows-1
50 c=1
60 FOR k=0 TO i
70 PRINT USING "####";c;
80 c=c*(i-k)/(k+1)
90 NEXT
100 PRINT
110 NEXT
120 RETURN</lang>
Output:
<pre>
Number of rows? 7
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
1 5 10 10 5 1
1 6 15 20 15 6 1
</pre>
=={{header|Haskell}}==
An approach using the "think in whole lists" principle: Each row in
the triangle can be calculated from the previous row by adding a
| |||