#include <stdio.h>

#include <stdlib.h>

/* recursive version of Fibonacci computation (for timing/graphing exercise) */


double fib(int j) {

   if (j <= 2) {

      return 1;

   }

   else {

      return fib(j-1) + fib(j-2);

   }

}



int main(int argc, char *argv[]) {

   int i;

   double answer;

   if (argc != 2) {

      printf("Usage: fib <num>\n");

      for (i=0;i<argc;i++) {

         printf("argv[%d] = %s\n", i, argv[i]);

      }
 
     exit(EXIT_FAILURE);

   }

   answer = fib(atoi(argv[1]));

   printf("%f\n", answer);

   exit(EXIT_SUCCESS);

}