# Netbean 8.1 using ui on java program. write a wedding lottery program

A beautiful princess is to select a husband from n suitors. The suitors are assigned numbers 0, . . . , n – 1 and seated at a round table, and a random sequence of n – 1 numbers x0x1, . . . , xn – 2, all of them in the range 0, . . . , n – 1 is selected. The princess starts at suitor 0, and moving in a clockwise direction, she counts off x0 positions and eliminates the suitor at that position. From there, she counts off another x1 positions and eliminates the suitor at that position. She continues doing this until one lucky guy is left: she marries him and they live happily ever after.

Assume that the princess’ position is always between two suitors. As an example, assume the suitors are ABC, and D, with A being numbered 0 and D being numbered 3. Let the random sequence be 0, 2, 1. Then the suitors will be eliminated in the order AD, and C, and the lucky suitor will be B.

Write a class that uses linked lists to help the princess make her decision. The constructor for the class will be passed the number n of suitors (say 4), followed by a list of n suitors’ names (say ABCD), followed by a list of n – 1 numbers used to “rotate” among the suitors (0, 2, 1). The current position starts at the beginning of the list. The class should have a method rotate(int x) that counts off x steps in the clockwise direction beginning at the current position. The class should have a method

List<String> getEliminated()

that returns a list, in order of elimination, of the names of the suitors already eliminated. The class should also have a method

List <String> getHopeful()

that returns a list of suitors not yet eliminated.

Write a driver program that obtains the input n, a list of n suitors’ names, and a list of n – 1 integers to be used as “rotate steps.” Using the class you have written, the program prints the names of the rejected suitors (in the order of rejection), and then prints the name of the lucky guy.

Pages (550 words)
Approximate price: -

Why Work with Us

Top Quality and Well-Researched Papers

We always make sure that writers follow all your instructions precisely. You can choose your academic level: high school, college/university or professional, and we will assign a writer who has a respective degree.

We have a team of professional writers with experience in academic and business writing. Many are native speakers and able to perform any task for which you need help.

Free Unlimited Revisions

If you think we missed something, send your order for a free revision. You have 10 days to submit the order for review after you have received the final document. You can do this yourself after logging into your personal account or by contacting our support.

Prompt Delivery and 100% Money-Back-Guarantee

All papers are always delivered on time. In case we need more time to master your paper, we may contact you regarding the deadline extension. In case you cannot provide us with more time, a 100% refund is guaranteed.

Original & Confidential

We use several writing tools checks to ensure that all documents you receive are free from plagiarism. Our editors carefully review all quotations in the text. We also promise maximum confidentiality in all of our services.

Our support agents are available 24 hours a day 7 days a week and committed to providing you with the best customer experience. Get in touch whenever you need any assistance.

Try it now!

## Calculate the price of your order

Total price:
\$0.00

How it works?

Fill in the order form and provide all details of your assignment.

Proceed with the payment

Choose the payment system that suits you most.

Our Services

No need to work on your paper at night. Sleep tight, we will cover your back. We offer all kinds of writing services.

## Essay Writing Service

No matter what kind of academic paper you need and how urgent you need it, you are welcome to choose your academic level and the type of your paper at an affordable price. We take care of all your paper needs and give a 24/7 customer care support system.