算法整理python

1.漢諾塔

def hanoi(n, a, b, c):
    if n > 0:
        hanoi(n - 1, a, c, b)
        print("moving from %s to %s"  % (a, c))
        hanoi(n - 1, b, a, c)


hanoi(2, 'A', 'B', 'C')

2.二分查找

3.排序