For this project, you are to write a recursive method that prints all of the objects in a bag. Use the bag specification from Figure 4.12, which is a bag of integers. The integers are to be printed in a random order—without using any of the bag private instance variables. For an empty bag, the method has no work to do (that is, it’s the stopping case). For a non-empty bag, the method carries out four steps: (1) Grab a random integer from the bag, storing it in a local variable oneItem; (2) print oneItem; (3) print any items that remain in the bag; and (4) put oneItem back in the bag. You’ll need to identify which of these steps is the “simpler version of the same problem.”

Transcribed Image Text:

FIGURE 4.12 Specification and Implementation of the IntLinkedBag Class Class IntLinkedBag * public class IntLinked Bag from the package edu.colorado.collections An IntLinkedBag is a collection of int numbers. Limitations: (1) Beyond Int. MAX_VALUE elements, countOccurrences, size, and grab are wrong. (2) Because of the slow linear algorithms of this class, large bags have poor performance. Specification • Constructor for the IntLinkedBag public IntlinkedBag( ) Initialize an empty bag. Postcondition: This bag is empty. add public void add (int element) Add a new element to this bag. Parameter: element – the new element that is being added Postcondition: A new copy of the element has been added to this bag. Throws: OutOfMemoryError Indicates insufficient memory for adding a new element.