Python function Recursive day15

The function calls itself inside itself

The wireless loop will be error-free, so a definite end condition is required

def Calc (n):     Print (n)    calc (n) Calc (10)

def Calc (n):     Print (n)     if int (N/2) = = 0        :return     nreturn calc (int (N/2 )) Calc (10)

Ask an example of a road

person = ['WL','WP','JP','yby','Tyn']Import TimedefAskway (person):Print('-'*60)    ifLen (person) = =0:return 'Nobody even knows .'P= Person.pop (0)#list pops up one at a time    ifp = ='yby':        return '%s said: See you at the next intersection.'%PPrint('hi boy%s, dare to ask where the road'%p)Print('%s replied: "I do not know, I help you ask the"%s "'%(P,person)) Time.sleep (3) Res=Askway (person)returnResres=Askway (person)Print(RES)

Python function Recursive day15