In Section 7.5.3, we demonstrated how the

Authors:

Michael T. Goodrich, Roberto Tamassia, Michael H. Goldwasser

Chapter:

List And Iterator Adts

Exercise:

Exercises

Question:28 | ISBN:9781118771334 | Edition: 6

Question

In Section 7.5.3, we demonstrated how the Collections.shuffle method can be adapted to shuffle a reference-type array. Give a direct implementation of a shuffle method for an array of int values. You may use the method, nextInt(n) of the Random class, which returns a random number between 0 and n−1, inclusive. Your method should guarantee that every possible ordering is equally likely. What is the running time of your method?