How to calculate Fibonacci's sequence using recursion ? I'll show you! This program shows a specified number of Fibonacci's sequence, based on the input from the user, which is that number's position.

fibonacci.c

#include <stdio.h>
/* This program shows a specified number of Fibonacci's sequence,
   out of the input from the user, which is that number's position.
*/

// Code made by Erick Giffoni
// contact : [email protected]
// github : https://github.com/ErickGiffoni
// linkedin : https://www.linkedin.com/in/erick-giffoni-022565167/
// Copyright © 2018 Erick Giffoni . All rights reserved.

int fib(int number);

int main(){

int number;
printf("Type down a number: ");
fflush(stdin);
scanf("%d", &number);
printf("The %d number of Fibonacci sequence is : %d\nWooowww\n", number+1, fib(number));

  return 0;
}

int fib(int number){
  int result = 0;
  result = number == 0 ? 0 : (number == 1 ? 1 : fib(number-1)+fib(number-2));
  return result;
}

For largest numbers this algorithm fails. I'll post another gist with a much better algorithm.
Here is the link : https://gist.github.com/ErickGiffoni/d037c3225a7c1d25ea463a1f62873eb9