Sorted Set Example – Ascending or Descending by comparator

Sorted Set Ascending order By TreeMap Example

package com.sheting.basic.collection.sorted;

import java.util.HashSet;
import java.util.Set;
import java.util.TreeSet;

public class SetSimpleSorting {
    public static void main(String... args) {
        Set<Integer> random = new HashSet<Integer>();
        for (int i = 0; i < 10; i++) {
            random.add((int) (Math.random() * 100));
        }
        System.out.println("Initial Set: " + random);

        Set<Integer> sorted = new TreeSet<Integer>(random);
        System.out.println("Sorted Set: " + sorted);
    }
}

Initial Set: [32, 99, 68, 55, 24, 56, 26, 60, 14, 78]
Sorted Set: [14, 24, 26, 32, 55, 56, 60, 68, 78, 99]

Sorted Set Descending order By TreeMap and Comparator Example

package com.sheting.basic.collection.sorted;

import java.util.Comparator;
import java.util.HashSet;
import java.util.Set;
import java.util.TreeSet;

public class SetComparableSorting {
    public static void main(String... args) {
        Set<Integer> random = new HashSet<Integer>();
        for (int i = 0; i < 10; i++) {
            random.add((int) (Math.random() * 100));
        }

        System.out.println("Initial Set: " + random);
        Set<Integer> sorted = new TreeSet<Integer>(new Comparator<Integer>() {
            @Override
            public int compare(Integer o1, Integer o2) {
                return o2.compareTo(o1);
            }
        });
        sorted.addAll(random);
        System.out.println("Sorted Set: " + sorted);
    }
}

Initial Set: [98, 37, 8, 41, 10, 43, 28, 76, 78]
Sorted Set: [98, 78, 76, 43, 41, 37, 28, 10, 8]