iteration hw • 1 min read

aspect=['reading','sleeping','Tiktok', 'Cooking']
def recursion(index):
    if(index==4):
        return
    else:
        print(aspect[index])
        recursion(index+1)
recursion(0)

reading
sleeping
Tiktok
Cooking

def fibonacci(x):
    if x==1:
          return(0) # First terminating statement
    if x == 2:
          return(1) # Second terminating statement
   
    else:
          return(fibonacci(x-1)+ fibonacci(x-2))


for i in range(8):    
        print(fibonacci(i+1))

0
1
1
2
3
5
8
13

def factorial(n):
    if n == 1:
        return n
    elif n >= 2:
        return factorial(n-1)*n
print(factorial(1003))

404806012311740744679036270515529766215557940835734423464308486954332335376288254026597109776449828814552102624613023065323278174358381591117731040618033605953577568765688184812138236066398630354088295679943744431609211665251966105488664972783084948140911617433638947639821528465807328708311905111398492004996557004373932434676019889340855363153792703551362166327668391491755559992196826980949990748447131699159817095253017289712236240541020499865567418523889695543184439844135298822157797379346421461197237271735132123779955963248570118669041957153613274045836510706588520927355846158960883232504130018266085869729735962543081550432043300069382198481882674872523111295999417614720983260576948269797116724132072594582704826558824565490662162987095647535503841768703791709747972520029041936601403596384912127705430863791092892475508262563729257193008250248925797932144600658039764598746557895459213036208935241227433432904034985341250784165383798624478624198037353932309740573978589999279405872228876665103144624228103371162050010078887976154735039714227745802478346311138906312566328467171612412886968179138232220856834602261828927848312050571975209349617246776164406049825181159812336830607645415955024430652446301529447454773119117693057664670390747151073235662046320326316526785597997925584630315323410772034763297865012750756259326754106980925537491712832380521513939442529518566590780576304159112726664245664857322261360129727207148879199226295641518212314617262921101973618812404842243805999868941508127867334021654849496877362571220140873383519021248519512690633676714275494596659788387028881393213188987112533588536093573888090575808402863594338877181587617344482272521484462294835445987162665090737855192669997779624370243956188368229356235532735766066280977586151443144951814833796714743763669416986979929314251854019359875445785447525614660788435656632159297770215770108403984695187395067188338516318841748160929761405345189069795095746993638660324488536421812312636464007466997960572789608441138298106533751802112346802155829306676908293865942565659917753731225437881965976256489906382773530581009927457176113935216572190605968971565669811353170645220172245330181743558293295994316257917965575856831216605881685602677100082186310458301451945902591902904145941606715504679111962082893648218703619437005056118286712832000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000

# fibonacci series. MUCH more efficient than recursion (handles cases up to orders of 10^5)
fiblist = [0,1]
def fib(n):
    if n <= 1:
        return fiblist[n]
    else:
        for i in range(n-2):
            fiblist.append(fiblist[-2]+fiblist[-1])
        return fiblist[-1]
        num = int(input())
print(fib(num))

8

The two terminating statements prevent from continuous recursion.