冒泡排序(BubbleSort)

冒泡排序 

python实现：

li = [11,23,2,42,32,54,123,23,5623767,23,24,65,678,9897,2454]

for j in range(1,len(li)):
    for i in range(len(li)-j):
        if li[i] > li[i + 1]:
            temp = li[i]
            li[i] = li[i + 1]
            li[i + 1] = temp

print(li)

 

递归：

def f(a1):
    r = f(a1+1)
    return r

f(0)

 

递归获取斐波那契数列某指定位置数：

def feb(time,a1,a2):
    if time == 10:
        return a1
    else:
        a3 = a1 + a2
        r = feb(time + 1,a2,a3)
        return r


ret = feb(1,0,1)
print(ret)