-
Notifications
You must be signed in to change notification settings - Fork 0
Word Search Solver designed to assess knowledge on various Data Structures and algorithms by utilizing priority queues and array searches to find terms within a grid of letters. Developed in C++ and later refactored into Java.
mozyn/WordSearchSolver
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
//INSTRUCTIONS FOR WORD SEARCH SOLVER Prepare Word Search in a .txt or .dat file with number of rows and columns at the top with a space in between. (ie. 4 6) 1. Read in Word Search 2. Type in word to search 3. View corresponding word in console or output file. 4. ??? 5. Profit
About
Word Search Solver designed to assess knowledge on various Data Structures and algorithms by utilizing priority queues and array searches to find terms within a grid of letters. Developed in C++ and later refactored into Java.
Resources
Stars
Watchers
Forks
Releases
No releases published