A random queue is a collection that supports the following API:

Write a class RandomQueue that implements this API. Use a resizing array. To remove an item, swap one at a random position (indexed 0 through \(n-1\) ) with the one at the last position (index \(n-1\) ). Then, remove and return the last item, as in ResizingArrayStack. Write a client that prints a deck of cards in random order using RandomQueue.

Transcribed Image Text:

public class RandomQueue RandomQueue () boolean isEmpty () void enqueue (Item item) Item dequeue () Item sample() create an empty random queue is the random queue empty? add item to the random queue remove and return a random item (sample without replacement) return a random item, but do not remove (sample with replacement) API for a generic random queue