Final Project for College Data Structures: Finds the most common words in a text file and the number of unique words (only occurs once in the file), accounting for invisible chars or otherwise invalid ones. Parses the file and builds a map using AVL Trees, BSTs, and hashmaps. Uses a comparator to sort the map, and uses StringBuilder and BufferedReader. Made to support the Bible and the number of occurrences in the text.
-
Notifications
You must be signed in to change notification settings - Fork 0
maricr-sk/CommonWordFinder
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
About
Finds top occurring words and unique words in a text (our sample was the Bible) through AVL trees, BSTs, and HashMaps. Uses StringBuilder, HashMaps, BufferedReader, and Comparators.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published