Chapter 12, Problem 24E

Explanation of Solution

Method definition:

/* Prints all ways to express n as a sum of squares of unique integers with precondition: n >= 0*/

//method definition

public static void printSquares(int n)

{

//define the integer sets

Set<Integer> chosen = new TreeSet<Integer>();

//call the method explore

explore(n, 1, chosen);

}

/* all ways are explored to form n as a sum of squares of integers starting

from the given min value and storing the chosen results with the given set*/

//method definition

private static void explore(int n, int min, Set<Integer> chosen)

{

//validate the value of n to be zero

if (n == 0)

{

//method call that is base case when sum has reached n

printHelper(chosen); 

}

else

{

// All possible combination are tried

//validate the choices upto sqrt(n)

int max = (int) Math...