2023-09-21 13:09:01 +00:00
|
|
|
def rebours(n):
|
|
|
|
if n == 0:
|
|
|
|
print()
|
|
|
|
return
|
|
|
|
print(n, end=" ")
|
|
|
|
rebours(n-1)
|
|
|
|
|
|
|
|
rebours(12)
|
|
|
|
|
|
|
|
def compte(t, n=1):
|
|
|
|
print(n, end=" ")
|
|
|
|
if n < t:
|
|
|
|
compte(t, n+1)
|
|
|
|
else:
|
|
|
|
print()
|
|
|
|
|
|
|
|
compte(5)
|
2023-09-21 13:41:09 +00:00
|
|
|
|
|
|
|
|
|
|
|
def sommeDesCarres(n):
|
|
|
|
if n == 1:
|
|
|
|
return 1
|
|
|
|
return n**2 + sommeDesCarres(n-1)
|
|
|
|
|
|
|
|
def produit(liste):
|
|
|
|
if len(liste) == 1:
|
|
|
|
return liste[0]
|
|
|
|
return liste[0] * produit(liste[1:])
|
|
|
|
|
|
|
|
def sommeDesPositifs(liste):
|
|
|
|
if len(liste) == 0:
|
|
|
|
return 0
|
|
|
|
value = liste[0] if liste[0] > 0 else 0
|
2023-09-21 13:52:09 +00:00
|
|
|
return value + sommeDesPositifs(liste[1:])
|
|
|
|
|
|
|
|
def estPalindrome(x):
|
|
|
|
if len(x) == 2:
|
|
|
|
return x[0] == x[1]
|
|
|
|
elif len(x) == 1:
|
|
|
|
return True
|
|
|
|
return x[0] == x[-1] and estPalindrome(x[1:-1])
|