Part 1 – Euclid (15pts)
Write a recursive implementation of Euclid’s Algorithm for finding the greatest common divisor (GCD) of two integers. You can find pseudocode for this algorithm online (be sure to include in your program description where you found the code). This procedure will use the procedure written in Assignment 7. The output shall be of the following format
Part 2 – Matrix of words (10pts)
At all times in this assignment, you must use the 2D row major format.
Create a procedure that generates a 5 x 5 matrix of randomly chosen capital letters. Each letter will have a 50% chance of being a vowel. (HINT: mod 2 might be helpful here)
Once you have your 5 x 5 matrix is built, print it out. Use a procedure for this.
Then build a procedure that will go through your matrix and find sets of letters which are comprised of 5 letters, 2 of which will be vowels. The order of the letters in the set is not important. For the following example, ABOST and TSOBA are equivalent. If there are no words, then the output should indicate that no words were found. There will be a maximum of 12 sets of letters (5 rows, 5 columns, 2 diagonals)
MORE INFO IN FILES ATTACHED
0 comments