/* The Fibonacci benchmark tests
     recursive procedure calls.

    From Dr. Dobb's Journal
         Feb. '89 P. 40
   Small C Version
*/

#include <stdio_h>

#define NUMBER 24
#define NTIMES 34

main() {
   int i, value, secs, d1[2], d2[2];

   *d1 = date();

   printf("%d iterations: ", NTIMES);

   for (i=1; i <= NTIMES; i++)
      value = fib(NUMBER);

   printf("\n");
   *d2 = date();
   secs = d2[1] - d1[1];
   printf("%d seconds\n",secs);
}

fib(x)
   int x;

   {
   if ( x > 2 )
         return (fib(x-1) + fib(x-2));
   else
         return (1);
}