Chapter 14.3, Problem 21SCP

Explanation of Solution

Given code:

//Execute while stack is non-empty

while(!s.isEmpty ())

{

    /*Remove the element from top of stack and assign to the variable*/

    int n = s.pop() ;

    //Check whether the element is odd

    if(n % 2 != 0)

    {

        //Add the element into the stack

        s.push(n); // put back in stack if odd

    }

}

Error:

• The odd elements are inserted back at the top of the stack each time, so the process never moves down towards the bottom of the stack.
• If any odd elements are contained in the stack, the given code gets stuck in an infinite loop.

Corrected code:

The above problem can be fixed by the below version of code,

//Create object for Stack

Stack<Integer> back_up = new Stack<Integer>();

//Execute while stack is non-empty

while(!s.isEmpty())

{

/*Remove the element from top of stack and assign to the variable*/

    int n = s...