Answer:
#include <stdio.h>
int fib(int n) {
if (n <= 0) {
return 0;
}
if (n <= 2) {
return 1;
}
return fib(n-1) + fib(n-2);
}
int main(void) {
for(int nr=0; nr<=20; nr++)
printf("Fibonacci %d is %d\n", nr, fib(nr) );
return 0;
}
Explanation:
The code is a literal translation of the definition using a recursive function.
The recursive function is not per se a very efficient one.
PErfect! 100% Absolutely beautiful.
Answer:
Given code output is "786".
Explanation:
Code:
list1 = [ 'cyber', 786 , 2.23, 'square', 70.2 ]#defining a list list1 that holds value in parameter
print (list1[1] )#use a print method that prints list index value
In the given code a list "list1" is declared that holds value in it and in the next step a print method is declared that prints the first index value of the list.