Recursion(帰納)
帰納 Recursion >> プログラミングでとてもパワフルな考え方
演繹 Deduction
Smallest input
base case = starting point
factorial (n) = n * (n-1) * (n-2) * ---- * 1
factorial(0) =1
factorial(n)=n*factorial(n-1) n>0
def factorial(n):
in n==0
return 1 (base case)
elese : return n*factorial(n-1)
factorial(3) = 3* factorial(2)
factorial(2)= 2*factorial(1)
palindromes=前から読んでも後ろから読んでも同じ言葉
level
a
""
def is_palindrome(s):
if s == " ":
return True
else:
if s[0]==s[-1]:
else return False