def factorial(n): if n == 1: return 1 else: return n * factorial(n - 1)
计算幂
1 2 3 4 5
def power(x, n): if n == 0: return 1 else: return x * power(x, n-1)
二分法查找
1 2 3 4 5 6 7 8 9 10 11 12 13
def bins(seq, num, begin=0, end=None): if end is None: end = len(seq)-1 if begin == end: if num == seq[begin]: return begin else: return None else: mid = (begin + end) // 2 if num > seq[mid]: return bins(seq, num, mid+1, end) else: return bins(seq, num, begin, mid)