算法

递归算法

def to_str(n,base):
    convert_string='0123456789ABCDEF'
    if n < base :
        return convert_string[n]
    else:
        return to_str(n//base,base)+convert_string[n%base]
print(to_str(11,2))
print(to_str(11,8))
print(to_str(11,16))
print(to_str(123456,16))

1011
13
B
1E240

def factoria(n):
    if n == 0 :
        return 1
    else:
        return n * factoria(n - 1)

def fibonacii(t):
    if t <= 1:
        return t
    else:
        return fibonacii(t-1)+fibonacii(t-2)

def good_fibonacii(t):
    if t < 2:
        return (t,t-1)
    else:
        (a,b) = good_fibonacii(t-1)
        return (a+b,a)


print(factoria(12))
print(fibonacii(12))
print(good_fibonacii(12))
print(good_fibonacii(12)[0])

　　结果

479001600
144
(144, 89)
144

海龟作图

import turtle
t= turtle.Turtle()
win = turtle.Screen()
def draw(t,line_len):
    if line_len>0:
        t.forward(line_len)
        t.right(90)
        draw(t,line_len-1)
draw(t,150)
win.exitonclick()