{
   FILENAME  : fibonacci.pas
   AUTHOR    : Christopher A. Gantz
   EMAIL     : cgantz@regis.edu
   STUDENT ID: 123-45-6789

   ASSIGNMENT: Recursion Example #1
   DUE DATE  : Mon. 12/13/04
   COURSE    : CS 241 (Control Structures)
   TERM      : Fall 8wk2 2004

   DESCRIPTION:
     Program to recursively calculate the Fibonacci series

}

program FibonacciTest(input, output);

const
        MIN = 1;
        MAX = 16;
var
        i: integer ;

Function fibonacci(n: integer): integer;

begin
  if (n = 1) OR (n = 2) THEN
    fibonacci := 1
  else
    fibonacci := fibonacci(n-1) + fibonacci(n-2);
end; { of Function fibonacci }

begin
   for i := MIN to MAX do
      begin
        write(fibonacci(i));
        if i < MAX THEN
          write(', ')
        else
          writeln('...');
      end
end.

{ Expected results:

1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987...

}