5903 Intro Scientific Prog:
Count B: Specification

  1. The program should count the number of occurences of each dipthong (two character pair) in a file.
  2. The program should read in the characters in batches of NMax.  There must be a seperate function call to read in the characters in bunches. 
  3. The output should be a list of the top NOut count dipthongs and their counts each on a new line with the character code pair (code1, code2) followed by two spaces and then a left justified long integer giving the number of occurences of that pair.
  4. The program should be tested against the following test files
  5. CountATest1, CountATest2, CountATest3.   The first two are plain text files.  The third has some other characters in it.
  6. Run and time your code on a download of a novel from the online Gutenburg project.  Include a report fo this test in the ReadMe file.