There are n people in a room, where n is an integer greater than or equal to 2. Each person shakes hands once with every other person. What is the total number of handshakes in the room? Write a recursive method to solve this problem with the following header:
public static int handshake(int n)
where handshake(n) returns the total number of handshakes for n people in the room. To get you started, if there are only one or two people in the room, then:
handshake(1) = 0
handshake(2) = 1
This is a short and relatively straightforward recursive problem.
See the code in Handshake.java.
You might also like to view...
Case-Based Critical Thinking QuestionsCase 1Penny is just starting out in her database coursework and she is looking for a quick primer on some of the key terms that she will use again and again. Her roommate Meredith has offered to give her the guidance she seeks. Penny has collected all of the fields for a given customer together. Meredith uses the term ____ to refer to this grouping.
A. valence B. column C. record D. relation
Use the Find _________________________ Query Wizard to find records in one table that have the same values in a field.
Fill in the blank(s) with the appropriate word(s).
If the test you performed for the scenario in Question 27 fails, what should your next step be?
What will be an ideal response?
A webpage can have a liquid layout without using media queries.?
Answer the following statement true (T) or false (F)