Java Comparator sort

        ArrayList<Integer> mItems = new ArrayList<>();
        for (int i = 0; i < 10; i++) {
            mItems.add((int) (Math.random() * 10));
        }
        Logger.d("Source data:" + mItems);

        ArrayList<Integer> mItems2 = new ArrayList<>();
        mItems2.addAll(mItems);

        Collections.sort(mItems, new Comparator<Integer>() {
            // The return value is of type int.
            // Greater than 0 means order (increasing) [o1 > o2], less than 0 means reverse order (decreasing) [o1 < o2].
            @Override
            public int compare(Integer o1, Integer o2) {
                if (o1 > o2) {
                    return 1;
                } else {
                    return -1;
                }
            }
        });
        Logger.d("After sorting (order):" + mItems);

        Collections.sort(mItems2, new Comparator<Integer>() {
            // The return value is of type int.
            // Greater than 0 means order (increasing), less than 0 means reverse order (decrement).
            // 0, equal.
            @Override
            public int compare(Integer o1, Integer o2) {
                if (o1 > o2) {
                    return -1;
                } else {
                    return 1;
                }
            }
        });
        Logger.d("After sorting (reverse order):" + mItems2);

output:

Source data: [4, 6, 9, 1, 2, 5, 0, 5, 8, 5]

After sorting (order): [0, 1, 2, 4, 5, 5, 5, 6, 8, 9]

After sorting (reverse order): [9, 8, 6, 5, 5, 5, 4, 2, 1, 0]