Question: IN JAVA: Part 1 : Select the Suitor Requirements In the great city of Atlantis, Prince Val had many suitors. He decided on the following

IN JAVA: Part 1: Select the Suitor Requirements
In the great city of Atlantis, Prince Val had many suitors. He decided on the following algorithm to determine which person he would marry. First, the suitors
would be lined up in order and assigned a number starting with 1, the second would be 2, and so on up to n suitors. Starting with the first, he would count
down the line with each letter of his name "V","a","l", and then the suitor at "I" would be eliminated from the line. Val would continue counting three more
suitors, and eliminating every third one. When Val reached the end of the line, he would resume counting at the beginning of the line.
For example, if there were seven suitors, the elimination process would be as follows:
Write a program that implements a linked list of nodes to determine the position a suitor should stand if they want to marry the prince, when there are n suitors. Your program should
eliminate the suitor by deleting the node corresponding to the suitor for each step of the process.
Each suitor also has a name. You should either add the name, a String, as part of the node object or use a parallel HashMap to perform a name lookup.
Your program should prompt the user for the number of suitors, each suitor's name, and then after your algorithm runs, print the selected suitor and their name.
Be sure to use prompts that make sense to a user who has never run your program before.
Sample Output
Select the Suitor.
Escape the Haunted House.
Sentiment Analysis.
Q. Quit.
Your option ==>1
Select the Suitor.
Enter the number of Suitors: 7
Enter name of Suitor #1: Doc
Enter name of Suitor #2: Grumpy
Enter name of Suitor #3: Happy
Enter name of Suitor #4: Sleepy
Enter name of Suitor #5: Bashful
Enter name of Suitor #6: Sneezy
Enter name of Suitor #7: Dopey
Suitor #3, Happy, eliminated.
Suitor #6, Sneezy, eliminated.
Suitor #2, Grumpy, eliminated.
Suitor #7, Dopey, eliminated.
Suitor #5, Bashful, eliminated.
Suitor #1, Doc, eliminated.
The correct suitor was #4, Sleepy.
IN JAVA: Part 1 : Select the Suitor Requirements

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Accounting Questions!