PA 6.1: Word stats

When completing this programming assignment, you may work with up to one other person. No groups of more than two are permitted.

Write a program that reads in text from the user until they enter the word DONEZO, then reports several stats about their text. Specifically, it should report:

• the number of total words entered
• the number of distinct words (case insensitive)
• the number of characters (the length of all input words summed together)
• the distribution of distinct words and their corresponding counts represented as a "bar graph" of characters (see the example)

You should use parallel (multiple) vectors or arrays to keep track of distinct words and their frequencies. For distinct words, use the `tolower()` function described in zyBook chapter 3.14 Character operations. You'll need to apply this to each character in an input word.  For showing the word distributions as bar graphs, you can use a loop to add enough spaces after a word (based on it's length) before the bar chart starts, or, if you'd like, you may use `setw`, as described in zyBook chapter 9.2 (and detailed in Table 9.2.2), to set the width of the word to something reasonable (e.g., 15 or 20).

Here's a run of a program that meets these criteria (your output doesn't have to look exactly the same as long as it has the same information and your formatting is good). User input is shown in bold orange.

$ ./word-stats
==== WORD STATS ====
Enter your text and enter DONEZO (all caps) when you're finished:
Mary had a little LAMB
little lamb 
little lamb 
Mary had a little lamb whose fleece was white as snow DONEZO

Stats:
  words: 20
  distinct words: 10
  characters: 81

Distribution:
  mary          XX
  had           XX
  a             XX
  little        XXXX
  lamb          XXXX
  whose         X
  fleece        X
  was           X
  white         X
  as            X
  snow          X
  

Copy the following header and specifications checklist and paste it at the top of your source code. As you complete the specifications, fill in the [ ] next to that specification in the check list (e.g., like this: [x]). I will not grade submissions with missing specifications; please do not submit if you cannot check all of them off.  This specs checklist is essentially a way for you to self grade before you submit your program.

// Name: 
// Date: 
// Partner: 
//
// Specifications checklist for PA 6.1 Word Stats
//
// General specs:
// [ ] the header includes your name and anyone you worked with
// [ ] the header includes this specifications checklist with all completed 
//     specifications checked off: [x]
// [ ] the code is indented properly (inside of every block, code is indented 
//     one more tab)
// [ ] each chunk of code that "hangs together" (works toward a higher level goal):
//     [ ] includes a brief, useful comment above it
//     [ ] is separated from the next chunk by a blank line
// [ ] there are no really long lines of code or comments (if you have long 
//     lines, split them across multiple shorter lines)
// [ ] identifiers are well named
// [ ] the program compiles 
// [ ] the program runs without crashing or hanging
// [ ] all output and prompts look clean (correct spelling, capitalization, 
//     nothing squished)
// [ ] all prompts make it clear what data the user is expected to enter and in 
//     what format and work as expected
//
// Specific specs: 
// [ ] the program prompts the user for their text (can be multiple lines of text)
// [ ] all words entered by the user are read in until the sentinel DONEZO is read in
//     [ ] the DONEZO sentinel is not counted in any of the stats
// [ ] the program uses parallel (multiple) arrays or vectors to store words and their counts
// [ ] words are stored and reported at the end in all lower case
// [ ] these stats are displayed at the end and are accurate:
//     [ ] the total number of words entered
//     [ ] the number of distinct words (case insensitive)
//     [ ] the number of characters (the length of all input words summed together, 
//         spaces not included)
//     [ ] the distribution of distinct words and their corresponding counts are 
//         represented as a bar graph
//     [ ] the left side of the bar graphs are aligned across words

If you are working with a partner, both of you must submit individually.