Scribd
Upload
4 views6 pages

Recursive Functions

The document outlines several procedures for calculating factorials, counting down from a number, and generating Fibonacci numbers using both iterative and recursive methods. It includes pseudocode for each function and procedure, detailing the logic and flow of execution. Additionally, it provides examples of function calls and their corresponding outputs.

Uploaded by

ekta chawla
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
4 views6 pages

Recursive Functions

The document outlines several procedures for calculating factorials, counting down from a number, and generating Fibonacci numbers using both iterative and recursive methods. It includes pseudocode for each function and procedure, detailing the logic and flow of execution. Additionally, it provides examples of function calls and their corresponding outputs.

Uploaded by

ekta chawla
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

FUNCTION Factorial(n : INTEGER) RETURNS INTEGER

Result ← 1
FOR i ← 1 TO n
Result ← Result * i
NEXT i
RETURN Result
ENDFUNCTION

FUNCTION Factorial(n : INTEGER) RETURNS INTEGER


IF n = 0
THEN
Result ← 1
ELSE
Result ← n * Factorial(n – 1)
ENDIF
RETURN Result
ENDFUNCTION

Call No Call Is n=0 Result Return Value


PROCEDURE CountDownFrom(n : INTEGER) //n=5
FOR i ← n DOWNTO 0
OUTPUT i
NEXT i
ENDPROCEDURE

PROCEDURE CountDownFrom(n : INTEGER) //n=5


OUTPUT n
IF n > 0
THEN
CALL CountDownFrom(n – 1)
ENDIF
ENDPROCEDURE
Call No Call Output Is n>0
1 CountDownFrom(5 5 True
)
2 CountDownFrom(4 4 True
)
3 CountDownFrom(3 3 True
)
4 CountDownFrom(2 2 True
)
5 CountDownFrom(1 1 True
)
6 CountDownFrom(0 0 False
)

PROCEDURE CountDownFrom(n : INTEGER) //n=5


IF n > 0
THEN
CALL CountDownFrom(n – 1)
ENDIF
OUTPUT n
ENDPROCEDURE
Call No Call Is n>0 Output
1 CountDownFrom(5 T
)
2 CountDownFrom(4 T
)
3 CountDownFrom(3 T
)
4 CountDownFrom(2 T
)
5 CountDownFrom(1 T
)
6 CountDownFrom(0 F 0
)
(5) CountDownFrom(1 F 1
)
(4) CountDownFrom(2 F 2
)
(3) CountDownFrom(3 F 3
)
(2) CountDownFrom(4 F 4
)
(1) CountDownFrom(5 f 5
)

Procedure Iterative_Fibonacci(n):

Declare f0, f1, fib as Integer

f0 = 0
f1 = 1

OUTPUT f0, f1

for i = 1 to n

fib = f0 + f1

f0 = f1

f1 = fib

OUTPUT fib

END for loop

END Procedure

Procedure main()

1 OUTPUT "Enter n:"

2 INPUT n

3 OUTPUT "Fibonacci numbers up to”, n ,” terms”

4 For i = 1 to n

5 OUTPUT fibo(i)

6 PRINT “dd”

7 End Loop

End Procedure

10 Function fibo(integer k) returns integer

11 if(k = 0 OR k = 1)

12 return k

13 else

14 return fibo(k-1)+fibo(k-2)
15 End Function

Call No Call Is k=0 or Return


k=1 Value
1 Fibo(7) F Fibo(6)+ Fibo(5) 13
2 Fibo(6) F Fibo(5)+ Fibo(4) 8
3 Fibo(5) F Fibo(4)+ Fibo(3) 5
Fibo(5) Fibo(4)+ Fibo(3) 5
Fibo(4) Fibo(3)+ Fibo(2) 3
Fibo(4) Fibo(3)+ Fibo(2) 3
Fibo(3) Fibo(2)+ Fibo(1) 2
Fibo(3) Fibo(2)+ Fibo(1) 2
Fibo(2) Fibo(1)+ Fibo(0) 1
Fibo(2) Fibo(1)+ Fibo(0) 1
Fibo(1) 1
Fibo(1) 1
Fibo(0) 0
Fibo(0) 0

You might also like