To start work get the latest version of the
ds_homework repository from
BitBucket. The input file is named biblewords.txt and can be found in the
data directory. It contains the text of the entire KJV Bible with one word
per line, no punctuation, and all words capitalized. You're welcome.
Your program should work in the following way:
After the word counts have been established create an array that references the tree elements and then sort the array by word count. Display the 20 most frequently appearing words along with their counts in a formatted table.
In addition you will display the amount of time for each task (processing, sorting, and total). You may assume that no word is longer than 25 characters and that that there will be no more than 15,000 unique words (there are over 700,000 words, total).
Your class will also need an unusual sort method that creates and sorts an array of references to the tree. You'll also need an unconvention display() method that displays the first 20 elements of the sorted array.
Programs will be graded according to the following criteria: