HW8: Count B

The purpus of this program is to count the number of occurences of each pair of characters in a file.

We read the characters in bunches of NMax. The output is a table 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 integer giving the number of occurences of that pair.

The program is tested against the following test files: CountATest1, CountATest2, CountATest3, Alice, and Science.  The last two are the download novels from the online Gutenburg project. For example, we type

rebecca_hw8 < CountATest1

to count the occurences of each pair of characters in CountATest1.

The running time is also computed. It is fast if we read characters in bunches.