#遞歸實現

def calc(n):

print(n)

if n/2 >1:

res = calc(n/2)

print('res:',res)

print('N:',n)

return n

calc(100)

#斐波那契數列

def func(arg1,arg2,stop)

if arg1 == 0:

print(arg1,arg2)

arg3 = arg1 + arg2

print(arg3)

if arg3 < stop:

func(arg2,arg3,stop)

func(0,1,30)

#算法基礎之二分查找

def binary_search(data_source,find_n):

mid = int(len(data_source)/2)

if len(data_source) > 1:

if data_source[mid] > find_n:

print("data in left of [%s]" % data_source[mid])

binary_search(data_source[:mid],find_n)

elif data_source[mid] < find_n:

print("data in right of [%s]" % data_source[mid])

binary_search(data_source[mid:],find_n)

else

print("found find_s",data_source[mid])

else:

print("connot find....")

if __name__ == '__main__':

data = list(range(1,6000000))

binary_search(data,65535)

總結

以上是生活随笔為你收集整理的python递归实现_Python-递归实现的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。