- 코드 (iterative version)
from math import factorial as f def combi(n,m) return f(n) / (f(m) * f(n-m))
- 코드 (recursive version)
def combi(n,m): if n == m: return 1 if m == 0: return 1 else: return combi(n - 1, m) + combi(n - 1, m - 1)
-> 효율성 측면에서 반복문을 활용하는것이 저 좋음
- 코드
def fibo(n): if n <= 1: return n return fibo(n - 1) + fibo(n - 2)
def solution(L, x, l, u):
if
l> u
:
return -1
mid = (l + u) // 2
if x == L[mid]:
return mid
elif x < L[mid]:
return
solution(L,x,l,mid-1)
else:
return
solution(L,x,mid+1,u)