Word puzzle problem is to find the words in a two-dimensional array of characters. The input to this problem is two input files: one is a two-dimensional array of characters and the other is a list of words we will find in two-dimensional array. These words may be horizontal, vertical, or diagonal in any direction (for a total of eight directions). Let’s look at a simple example with chars: A 2-D 7x7 puzzle and a word list file are as follows: See image.

Write a program to find for this problem and run your program with two given input data files (50 x 50 puzzle and a list of words in class web page). And measure the actual running times of your program.

Each direction running time is O(n ^3). Therefore the total running time is (O(n^3) * 8) because there are 8 total directions.

Academic Honesty!
It is not our intention to break the school's academic policy. Projects posted are only used as a reference and should not be submitted as is. We are not held liable for any misuse of the solutions. Please see the frequently asked questions page for further questions and inquiries.
Kindly fill out the form. Please provide a valid email address and we'll get back to you in less than 24 hours. We will be sending an invoice through PayPal upon confirmation. We are a non profit organization however we need an amount to keep this organization running, and to be able to complete our research and development.