Question

Write a recursive function which implements the pascal's triangle: 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 in python

Answer 1

Explanation:

def triangle(n):

temp=[]

if n==0:

return []

if n==1:

return [[1]]

else:

Pascal_triangle=[[1]]

for i in range(1,n):

print i

for j in range(0,len(Pascal_triangle[i-1])):

print j

if j==0:

temp.append(Pascal_triangle[i-1][0])

print temp

else:

temp.append(Pascal_triangle[i-1][j-1]+Pascal_triangle[i-1][j])

print temp

temp.append(1)

Pascal_triangle.append(temp)

temp=[]

return Pascal_triangle