import java.util.Arrays;
import java.util.Random;

public class Speedy {
    public static void main1(String[] args) {
        Random r = new Random();
        int maxx = 10000000;
        int[] arr = new int[maxx];
        long st = System.nanoTime();
        for (int i = 0; i < maxx; i++) {
            arr[i] = r.nextInt(maxx);
        }
        Arrays.sort(arr);
        long nd = System.nanoTime();
        System.out.println("time " + ((nd - st) / 1000000.0));
        //System.out.println(Arrays.toString(arr));
    }

    private class GGG implements Comparable<GGG> {
        int ii;

        @Override
        public int compareTo(GGG o) {
            return o.ii - this.ii;
        }

        public GGG(int a) {
            ii = a;
        }
    }
    
    public void doSort() {
        Random r = new Random();
        int maxx = 10000000;
        GGG[] arr = new GGG[maxx];
        long st = System.nanoTime();
        for (int i = 0; i < maxx; i++) {
            arr[i] = new GGG(r.nextInt(maxx));
        }
        Arrays.sort(arr);
        long nd = System.nanoTime();
        System.out.println("time " + ((nd - st) / 1000000.0));
        //System.out.println(Arrays.toString(arr));
    }
    
    public static void main(String[] args) {
        (new Speedy()).doSort();
    }
}