I already answered the same question earlier. Keep in mind that none of the functions you mentioned are recursive
functions. You can read more about recursion here.
This is the example I mentioned here.
Python 3.X
def asterix_triangle(i, t=0):
if i == 0:
return 0
else:
print(' ' * ( i + 1 ) + '*' * ( t * 2 + 1 ))
return asterix_triangle( i - 1, t + 1 )
asterix_triangle(5)
And here you have an upside down version of an recursive function.
def upside_down_asterix_triangle(i, t=0):
if i == 0:
return 0
else:
print(' ' * ( t + 1 ) + '*' * ( i * 2 - 1 ))
return upside_down_asterix_triangle( i - 1, t + 1 )
upside_down_asterix_triangle(5)
Python 2.X
def asterix_triangle(i, t=0):
if i == 0:
return 0
else:
print ' ' * ( i + 1 ) + '*' * ( t * 2 + 1 )
return asterix_triangle( i - 1, t + 1 )
asterix_triangle(5)
And here you have an upside down version of an recursive function.
def upside_down_asterix_triangle(i, t=0):
if i == 0:
return 0
else:
print ' ' * ( t + 1 ) + '*' * ( i * 2 - 1 )
return upside_down_asterix_triangle( i - 1, t + 1 )
upside_down_asterix_triangle(5)
Edit: Screenshot showing the script running in my IDE.
Edit2: Added code that works under Python 3.x
Edit3: Added iterative function for Python 3.X
def create_pyramid(rows):
for i in range(rows):
print((' ' * ( rows- i - 1 ) + '*' * ( 2 * i + 1)))
print((create_pyramid(5)))
def create_upside_down_pyramid(rows):
for i in reversed(list(range(rows))):
print((' ' * ( rows- i - 1 ) + '*' * ( 2 * i + 1)))
print((create_upside_down_pyramid(5)))