This document provides an assignment to write a program using recursion to generate negative Fibonacci numbers. It gives the input and output requirements, which are to read an integer and print the Fibonacci numbers up to that value. It provides examples of sample runs with different inputs and expected outputs. It also gives some pre-requisites of arithmetic operators and recursions and the objective of understanding recursive functions.

1. Team Emertxe
Function and Pointer
Basics

2. Assignment 18

3. Assignment 18

4. Assignment 18
WAP to generate negative fibonacci numbers using
Recursion.

5. Assignment 18
WAP to generate negative fibonacci numbers using
Recursion.
Input:

6. Assignment 18
WAP to generate negative fibonacci numbers using
Recursion.
Input: Read integer ‘num’

7. Assignment 18
WAP to generate negative fibonacci numbers using
Recursion.
Input: Read integer ‘num’
Output:

8. Assignment 18
WAP to generate negative fibonacci numbers using
Recursion.
Input: Read integer ‘num’
Output: Print negative fibonacci numbers upto ‘num’

9. Assignment 18
WAP to generate negative fibonacci numbers using
Recursion.
Input: Read integer ‘num’
Output: Print negative fibonacci numbers upto ‘num’
Note: Should not use static and global variables.

10. Assignment 18
Example’s:

11. Assignment 18
Example’s:
Input: num = -8
Output: 0, 1, -1, 2, -3, 5, -8

12. Assignment 18
Example’s:
Input: num = -8
Output: 0, 1, -1, 2, -3, 5, -8
0 1

13. Assignment 18
Example’s:
Input: num = -8
Output: 0, 1, -1, 2, -3, 5, -8
0 -1
1
0 - 1 = -1

14. Assignment 18
Example’s:
Input: num = -8
Output: 0, 1, -1, 2, -3, 5, -8
0 2
-1
1
0 - 1 = -1
1 - (-1) = 2

15. Assignment 18
Example’s:
Input: num = -8
Output: 0, 1, -1, 2, -3, 5, -8
0 -3
2
-1
1
0 - 1 = -1
1 - (-1) = 2
-1 - 2 = -3

16. Assignment 18
Example’s:
Input: num = -8
Output: 0, 1, -1, 2, -3, 5, -8
0 5
-3
2
-1
1
0 - 1 = -1
1 - (-1) = 2
-1 - 2 = -3
2 –(-3) = 5

17. Assignment 18
Example’s:
Input: num = -8
Output: 0, 1, -1, 2, -3, 5, -8
0 5
-3
2
-1
1 -8
0 - 1 = -1
1 -(-1) = 2
-1 - 2 = -3
2 -(-3) = 5
-3 - 5 = -8

18. Assignment 18
Example’s:

19. Assignment 18
Example’s:
Input: num = -8

20. Assignment 18
Example’s:
Input: num = -8
Output: 0, 1, -1, 2, -3, 5, -8

21. Assignment 18
Example’s:
Input: num = -8
Output: 0, 1, -1, 2, -3, 5, -8
Input: num = -10

22. Assignment 18
Example’s:
Input: num = -8
Output: 0, 1, -1, 2, -3, 5, -8
Input: num = -10
Output: 0, 1, -1, 2, -3, 5, -8

23. Assignment 18
Example’s:
Input: num = -8
Output: 0, 1, -1, 2, -3, 5, -8
Input: num = -10
Output: 0, 1, -1, 2, -3, 5, -8
Input: num = 21

24. Assignment 18
Example’s:
Input: num = -8
Output: 0, 1, -1, 2, -3, 5, -8
Input: num = -10
Output: 0, 1, -1, 2, -3, 5, -8
Input: num = 21
Output: Invalid input

25. Assignment 18
Example’s:
Input: num = -8
Output: 0, 1, -1, 2, -3, 5, -8
Input: num = -10
Output: 0, 1, -1, 2, -3, 5, -8
Input: num = 21
Output: Invalid input
Input: num = -21

26. Assignment 18
Example’s:
Input: num = -8
Output: 0, 1, -1, 2, -3, 5, -8
Input: num = -10
Output: 0, 1, -1, 2, -3, 5, -8
Input: num = 21
Output: Invalid input
Input: num = -21
Output: 0, 1, -1, 2, -3, 5, -8, 13, -21

27. Sample execution:-
Assignment 18

28. Sample execution:-
Assignment 18

29. Sample execution:-
Assignment 18

30. Sample execution:-
Assignment 18

31. Assignment 18
Pre-requisites:-

32. Assignment 18
Pre-requisites:-
Arithmetic operators

33. Assignment 18
Pre-requisites:-
Arithmetic operators
Recursions

34. Assignment 18
Pre-requisites:-
Arithmetic operators
Recursions
Objective:-

35. Assignment 18
Pre-requisites:-
Arithmetic operators
Recursions
Objective:-
To understand the concept of Recursive Functions.

36. Team Emertxe
Thank you