COP 4838 Programming III - project 1 : pgm1_COP4338_C
 
Professor: Michael Robinson 
e-mail   : michael.robinson@fiu.edu 
Web Page : www.cs.fiu.edu/~mrobi002/teaching 

Follow programming rules at:
http://users.cis.fiu.edu/~mrobi002/includes/PGM3_programmingRulesC


This class is ANSI C (not c++)
DO NOT USE any IDE to create these programs
On the Linux terminal mode use any of its editors
 
Worth 10 points

1 - Worth 3 points
    As an example use the recursion.java program located at:
    http://users.cis.fiu.edu/~mrobi002/teaching/recursion.java
    to implement the following project in ANSI C:

  - Using int numbers only, implement recursion to find the 
    factorial of 50, stopping at the first positive int where
    recursion fails.
 
  - Using long numbers only, implement recursion to find the 
    factorial of 50, stopping at the first positive float where
    recursion fails.

2 - Worth 3 points
    Using binary search
    - Load into primary memory in a single dimension array the 
      numbers from 1 to 1,000,000.
    - Find out how many reads/searches it takes to find the numbers:
      5; 279,000; 555; and 897,000 
 
      Display results as: To find number x it took y reads/searches.

3 - Worth 3 points
    Divide by zero error catching
    Accept first number, if it is -1 exit function.
    Accept second number, is it is -1 exit function,
    if it is 0 request second number again until it
    is not 0.
    Divide first number by second number displaying all numbers.
    
4 - Worth 1 point
    Using firstNumber = 897, secondNumber = 78, thirdNumber = 15
    display them in ascending order e.g.  15, 78, 897
    using the standard swapping algorithm shown in class.