#!/usr/bin/perl
# Fig 6.14: fig06_14.pl
# Recursive fibonacci function.

@sampleValues = (0, 1, 2, 3, 4, 5, 6, 10, 20, 30, 35);

# Calculate and print the fibonacci value of all the above values
foreach ( @sampleValues ) {
   print "fibonacci( $_ ) = ", fibonacci( $_ ), "\n";
}

# fibonacci recursively calculates the fibonacci number
# of its integer argument
sub fibonacci
{
   my $number = shift;  # get the first argument

   if ( $number == 0 or $number == 1 ) { # base case
      return $number;
   } 

   else {                                # recursive step
      return fibonacci( $number - 1 ) + 
             fibonacci( $number - 2 );
   }
}



###########################################################################
#  (C) Copyright 2001 by Deitel & Associates, Inc. and Prentice Hall.     #
#  All Rights Reserved.                                                   #
#                                                                         #
#  DISCLAIMER: The authors and publisher of this book have used their     #
#  best efforts in preparing the book. These efforts include the          #
#  development, research, and testing of the theories and programs        #
#  to determine their effectiveness. The authors and publisher make       #
#  no warranty of any kind, expressed or implied, with regard to these    #
#  programs or to the documentation contained in these books. The authors #
#  and publisher shall not be liable in any event for incidental or       #
#  consequential damages in connection with, or arising out of, the       #
#  furnishing, performance, or use of these programs.                     #
###########################################################################