c program need same output

1 - WAP to generate fibbonacci numbers using recursive

Description:

In mathematics, the Fibonacci numbers or Fibonacci sequence are the numbers in the following integer sequence 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144 . . .OR 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144 . . .

By definition, the first two numbers in the Fibonacci sequence are either 1 and 1, or 0 and 1, depending on the chosen starting point of the sequence, and each subsequent number is the sum of the previous two.

Pr-requisites:

Arithmetic Operators

Recursions

Objective: -

To understand the concept of

Recursive Functions

Inputs: - Integers N Note : Should not use static and global variables. Sample execution: - Test Case 1 : Enter a number: 8 0, 1, 1, 2, 3, 5, 8 Test Case 2: Enter a number: 10 0, 1, 1, 2, 3, 5, 8 Test Case 3: Enter a number: 21

0, 1, 1, 2, 3, 5, 8, 13, 21

Test Case 4: Enter a number: -12

Invalid input

//

2 - WAP to generate negative fibbonacci numbers using recursion Description:

In mathematics, the Fibonacci numbers or Fibonacci sequence are the numbers in the following integer sequence 0, 1, -1, 2, -3, 5, -8, 13, -21, 34, -55, 89, -144 . . .

By definition, the first two numbers in the Fibonacci sequence are 0 and 1, each subsequent number is the subtraction of the previous two

Pr-requisites:

Arithmetic Operators

Recursions

Objective: -

To understand the concept of

Recursive Functions

Inputs: -

Integers N

Sample execution: - Test Case 1 : user@emertxe] ./fibbonacci_series Enter a number: -8 0, 1, -1, 2, -3, 5, -8 Test Case 2: Enter a number: -10 0, 1, -1, 2, -3, 5, -8 Test Case 3: Enter a number: -21

0, 1, -1, 2, -3, 5, -8, 13, -21

Test Case 3: Enter a number: 21

Invalid input