Lab06, fall 2017.  Due Thursday, Sept 21 by midnight.

2 points / problem

*** Checkpoint - problem 1 and 2a must be correct by Wednesday.  Problem 2 must be correct by Friday.

Put files in ~/HW/lab06/

1. Copy the following from ~jkinne/public_html/cs202-f2017/CLASS/DS/ into your ~/HW/lab06/ directory:
     Makefile, words.c, words.h, simple.c

   In your ~/HW/lab06/ directory rename simple.c to be lab06_simple1.c

   In your ~/HW/lab06/Makefile, rename simple.c to be lab06_simple1.c

   Note: the Makefile pulls words.c and words.h from my directory.  You will not modify words.c or words.h


2. Make a copy lab06_simple2.c of your lab06_simple.c
   Edit your Makefile to have an entry for lab06_simple2.c
   
   In lab06_simple2.c, modify the main function so that -
   
   2a) You do NOT print the entire words array (comment out the print_simple call in main)
   
   2b) After the loop in main, loop through the words array to determine:
         the total count, smallest count, and highest count.

   2c) Print the total count, total number of different words, average count, smallest count, and highest count.

   Note - for 2b and 2c, if there are no words in the input then print "No words in input.\n".
   Note - don't worry about if the actual number of different words is greater than MAX_WORDS.


3. Make a copy of lab06_simple3.c of your lab06_simple2.c
   Edit your Makefile to have an entry for lab06_simple3.c
   
   In lab06_simple3.c, add the following after the part you completed for #2 -
   
   3a) Use printf/scanf to ask the user for a word to lookup.

   3b) Lookup the word in the words array and print the count, or print "not found" if it is not in the words array.


4. Make a copy of your lab06_simple4.c of your lab06_simple3.c
   Edit your Makefile to have an entry for lab06_simple3.

   4a) In your loop that finds the min and max counts, also keep track of what index has the min and max,
       and when you print the min and max also print the words that have the min and max.
       If there is more than one word that has the min or max, print the one that is first in the array
       (which means only update the min/max when there is a count that is strictly smaller/larger).


5. Come and see me outside of class in my office to discuss how things are going, answer questions, etc.
   Times that are available:
     Fri 9/8, 1-4pm
     Mon 9/11 8:30-11, 12-3pm
     Tue 9/12 9:30-4