• For the next several labs, we will explore different algorithms and data structures for solving the word counting problem:
  • Given a document, how many times does each word in the document appear?
• For this lab, we will employ the following algorithms and data structure:
  • Each word and its count will be stored in a sorted array.
  • When each new word is added, it is inserted into the array in sorted order.
  • When an existing word's count is increased or retrieved, it is found using binary search.
• As an interesting test case, we will use Herman Melville's classic novel Moby Dick.
• Download the provided code.
• The code for these labs will be incorporated into the editor project.
• The code includes the following files:
  • editor.wordcount package
    • SortedArrayWordCounter.java: An implementation of WordCounter using a sorted array.
      • This is the only file you will modify.
      • Within the file, modify the following methods:
        • Change bump() to insert in sorted order when a new word is added.
        • Change find() to perform binary search.
    • SortedArrayWordCounterTest.java: Unit tests for SortedArrayWordCounter.java.
    • WordCounter.java: An interface defining WordCounter classes.
    • WordCounterEntry.java: A class representing a word and its count.
    • WordCounterTest.java: Basic unit tests for all WordCounter classes.
    • ArrayWordCounter.java: An implementation of WordCounter using an unsorted array.
    • TimeTest.java: Program that compares the running times of different WordCounter implementations using Moby Dick.
• Once your solution is working, run TimeTest to compare its performance with the unsorted version provided.

Grading