Notes

Libraries - Everything but STL algorithms Works I-VI use open hashing (separate chaining) Works VII-XII use linear probing Read once, string-by-string Display (and log) a list of words by their number of occurrences Display once, most to least Again, least to most Clean words during input Capitalization doesn't matter keep single hyphens Discard double hyphens Let the user search for words 8 at a time (use '@@@' to mark queries that have less than 8 words) Need to be able to display the number of sentences in the text Report the time it takes for each task All files need .h headers

To Do

• Implement Open Hashing
• Implement linear probing
• Cleaning strings
• Change the hash function?
• Detect chapter headings and split input for open hashing and linear probing
• Pattern matching
• Report times
  • Open hashing
  • Linear probing
• Count sentences
  • Ignore '!'
  • Count '?'
  • Count '.'
• Test multiple hash functions
• Test different occupancy ratios
• Split headers and cpps
  • OpenHashing.h
  • LinearProbing.h
  • Function.h?

Remember to turn on light mode

Division

Russell - Writing paper Patrick - Reporting times Ian - Rabin-Karp