/* File: fib1.c
   A recursive function for Fibonacci numbers
*/

int fib(int n) {

   if (n <= 1) return 1;

   return fib(n-1) + fib(n-2) ;
}

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

   if (argc !=2) {
      printf("Wrong number of arguments!\n") ;
      exit() ;
   }

   r = sscanf(argv[1],"%d", &n) ;
   if (r != 1) {
      printf("Need an integer argument!\n") ;
      exit() ;
   }

   printf("Fib(%d) = %d\n", n, fib(n)) ;
}
