Last active
January 9, 2019 17:14
-
-
Save obikag/f12ad029f70c0b21ebe4 to your computer and use it in GitHub Desktop.
Pascal's Triangle calculated using a recursive function in Python
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
''' | |
Created on Feb 24, 2015 | |
''' | |
import sys | |
# Recursive method to create the mathematical series | |
def pascal(col,row): | |
if(col == 0) or (col == row): | |
return 1 | |
else: | |
return pascal(col-1,row-1) + pascal(col,row-1) | |
# Method returns the results of n rows in the triangle | |
def PascalTriangle(num): | |
if (num <= 0): | |
print('Number must be greater than zero') | |
for r in range(num): | |
for c in range(r+1): | |
sys.stdout.write(str(pascal(c,r))+' ') | |
sys.stdout.write('\n') | |
#Test Section | |
PascalTriangle(10) | |
''' | |
Output: | |
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 | |
1 7 21 35 35 21 7 1 | |
1 8 28 56 70 56 28 8 1 | |
1 9 36 84 126 126 84 36 9 1 | |
''' | |
PascalTriangle(0) # returns 'Number must be greater than zero' |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment