+1 (218) 451-4151
glass
pen
clip
papers
heaphones

1. Complete the previous exercise, except using a dynamic array to provide unbounded capacity. 2….

1. Complete the previous exercise, except using a dynamic array to provide unbounded capacity. 2….

1. Complete the previous exercise, except using a dynamic array to provide unbounded capacity.2. Modify our ArrayList implementation to support the Cloneable interface, as described in Section 3.6.3. 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?