The following code fragment (adapted from a Java programming book) creates a random permutation of the integers from 0 to \(n-1\). Determine the order of growth of its running time as a function of \(n\). Compare its order of growth with the shuffling code in SECtion 1.4.

Transcribed Image Text:

int[] a = new int[n]; boolean[] taken = new boolean [n]; int count = 0; while (count