Chapter 14, Problem 4P

Explanation of Solution

Recursive function for “handshake” function:

The recursive function definition for “handshake” function is shown below:

//Function definition for "handshake" function

int handshake(int n)

{

      /* If "n" is equal to "1", then */

      if(n == 1)

            //Returns "0"

            return 0;

      /* If "n" is equal to "2", then */

      else if(n == 2)

            //Returns "0"

            return 1;

      //Otherwise

      else

     /* Recursively call the function "handshake" with subtracting the value of "n" with "1" */

            return n - 1 + handshake(n - 1);

}

Explanation:

The above function is used to compute the number of handshakes in a room using recursive function.

• In this function, If the value of “n” is equal to “1”, then returns “0”.
• If the value of “n” is equal to “2”, then returns “1”.
• Otherwise, that is if the value of “n” is greater than “2”, then returns the value by “n - 1 + handshake(n - 1)”...