Please write an algorithm for the following problem. Remember that solutions should be simple, clear, and obvious.
The Jumble Problem: Word X is a jumble of word Y if the letters in X can be rearranged to give Y. Example: backwards drawbacks. Given a finite dictionary of size N, find the largest group of words all of which are jumbles of each other.
Your algorithm should be able to find the largest group of jumbles and the number of words in that group.
Part A: Predict what the variables k and z would equal in the program shown below. Show all floating point results to two decimal places.
/15 Marks
Create a "choose your own adventure" game in Java.
Your game should have at least 25 branches and should take about 5 minutes to play all the way through. Below is a template to help get you started.
For Loops are one of the types of loops described in the Looping article. Program each of the following questions in Java:
Start by writing a “for” loop from 1 to 500 and prints the counter to the screen.
Output should look like this:
1
2
3
etc.
