python 基础11-递归

# 处于死循环
import time
def a(n):
     print(n)
     time.sleep(1)
     a(n)
a(10)


# 打印10,5,2,1
def calc(n):
    print(n)
    if int(n/2) == 0:
        return n
    return calc(int(n/2))  #相当于 内部调用函数
calc(10)
# ==
def calc(n):
    print(n)
    if int(n/2) == 0:
        return n
    res = calc(int(n/2))  #相当于内部调用
    return res  #一直不执行
calc(10)

# 问路 A->B->C->D，D->C->B->A
import time
person_list=[‘alex‘,‘wupeiqi‘,‘yuanhao‘,‘linhaifeng‘]
def ask_way(person_list):
    print(‘-‘*60)
    if len(person_list) == 0:
        return ‘没人知道‘
    person=person_list.pop(0)
    if person == ‘linhaifeng‘:
        return ‘%s说:我知道,老男孩就在沙河汇德商厦,下地铁就是‘ %person
    print(‘hi 美男[%s],敢问路在何方‘ %person)
    print(‘%s回答道:我不知道,但念你慧眼识猪,你等着,我帮你问问%s...‘ %(person,person_list))
    time.sleep(3)
    res=ask_way(person_list)
    # print(‘%s问的结果是: %res‘ %(person,res))
    return res

res=ask_way(person_list)
print(res)