Good counting sort for reference

CountingSort.java

public class CountingSort {

    static int[] countingSort(int arr[]) {
        int[] aux = new int[arr.length];

        int min = arr[0];
        int max = arr[0];
        for (int i = 1; i < arr.length; i++) {
            if (arr[i] < min) {
                min = arr[i];
            } else if (arr[i] > max) {
                max = arr[i];
            }
        }

        int[] count_list = new int[max - min + 1];

        for (int i = 0; i < arr.length; i++) {
            count_list[arr[i] - min]++;
        }

        count_list[0]--;
        for (int i = 1; i < count_list.length; i++) {
            count_list[i] = count_list[i] + count_list[i - 1];
        }

        for (int i = arr.length - 1; i >= 0; i--) {
            aux[count_list[arr[i] - min]] = arr[i];
            count_list[arr[i] - min]--;
        }

        return aux;
    }

    static void print(int arr[], int n) {
        for (int i = 0; i < n; i++)
            System.out.print(arr[i] + " ");
        System.out.println();
    }

    public static void main(String[] args) {

        int[] unsorted = {
            5,
            3,
            12,
            2,
            4,
            1,
            99,
            5,
            2,
            3,
            1,
            4
        };
        print(unsorted, unsorted.length);

        int[] sorted = countingSort(unsorted);
        print(sorted, sorted.length);

    }
}