String Sorting V2 With Interfaces and Lambdas

package chapter7;

import java.util.*;

public class StringSorting2 {

    private static final Random random = new Random();
    private static final char[] symbols = new char[62];

    static {
        for (int idx = 0; idx < 10; ++idx)
            symbols[idx] = (char) ('0' + idx);
        for (int idx = 10; idx < 36; ++idx)
            symbols[idx] = (char) ('a' + idx - 10);
        for (int idx = 36; idx < 62; ++idx)
            symbols[idx] = (char) ('A' + idx - 36);
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        System.out.print("Enter array size: ");
        int size = sc.nextInt();
        System.out.print("Min String Length: ");
        int minlen = sc.nextInt();
        System.out.print("Max String Length: ");
        int maxlen = sc.nextInt();
        sc.close();

        String baseData[] = generateRandomStrings(size, minlen, maxlen);
        printData("Base Data", baseData);

        String data[] = copyArray(baseData);
        sortGeneric(data, new Sensitive());
        printData("Case Insensitive Generic Sort", data);

        data = copyArray(baseData);
        sortGeneric(
            data,
            (x, y) -> {return x.compareToIgnoreCase(y) > 0;}
            );
        printData("Case Insensitive Generic Sort", data);

    }

    private static void sortGeneric(String[] data, Sorter method) {
        for (int i = 0; i < data.length - 1; i++)
            for (int j = i + 1; j < data.length; j++) {
                if (method.compareto(data[i], data[j])) {
                    String temp = data[i];
                    data[i] = data[j];
                    data[j] = temp;
                }
            }
    }

    private static String[] copyArray(String[] baseData) {
        String data[] = new String[baseData.length];
        for (int i = 0; i < baseData.length; i++) {
            data[i] = baseData[i];
        }
        return data;
    }

    private static String[] generateRandomStrings(int size, int min, int max) {
        String data[] = new String[size];
        for (int i = 0; i < data.length; i++) {
            data[i] = generateString(min, max);
        }
        return data;
    }

    private static String generateString(int min, int max) {
        if (min > max)
            throw new IllegalArgumentException("min: " + min + " > max: " + max);
        int length = min + random.nextInt(max - min + 1);
        String x = "";
        for (int i = 0; i < length; i++) {
            x += symbols[random.nextInt(symbols.length)];
        }
        return x;
    }

    private static void printData(String header, String[] data) {
        System.out.println(header);
        System.out.println();
        for (int i = 0; i < data.length; i++) {
            System.out.println(data[i]);
        }
        System.out.println();
        System.out.println();
    }

}


//************************************************************************

interface Sorter {
    boolean compareto(String x, String y);
}

class Sensitive implements Sorter {
    @Override
    public boolean compareto(String x, String y) {
        return x.compareTo(y) > 0;
    }
}

class Insensitive implements Sorter {
    @Override
    public boolean compareto(String x, String y) {
        return x.compareToIgnoreCase(y) > 0;
    }
}