Get comparator in reverse order

static<T> Comparator<T> reverseOrder(): Returns a comparator that imposes the reverse of the natural ordering on a collection of objects that implement the Comparable interface.
static<T> Comparator<T> reverseOrder(Comparator<T> cmp): Returns a comparator that imposes the reverse ordering of the specified comparator.


import java.util.Collections;
import java.util.Set;
import java.util.TreeSet;

public class MainClass {
  public static void main(String args[]) throws Exception {
    String elements[] = { "S", "P", "E","G", "P" };
    Set set = new TreeSet(Collections.reverseOrder());
    for (int i = 0, n = elements.length; i < n; i++) {
      set.add(elements[i]);
    }
    System.out.println(set);
  }
}

The output:


[S, P, G, E]


import java.util.Collections;
import java.util.Comparator;
import java.util.LinkedList;
  
public class MainClass {
  public static void main(String args[]) {  
    LinkedList<Integer> ll = new LinkedList<Integer>();  
    ll.add(-8);  
    ll.add(20);  
    ll.add(-20);  
    ll.add(8);  

    Comparator<Integer> r = Collections.reverseOrder();  

    Collections.sort(ll, r);  
  
    System.out.print("List sorted in reverse: ");      
    for(int i : ll){
        System.out.print(i+ " ");
    } 
        
    System.out.println();  
  
    Collections.shuffle(ll);  
  
    System.out.print("List shuffled: ");      
    for(int i : ll) 
      System.out.print(i + " ");  
 
    System.out.println();  
  
    System.out.println("Minimum: " + Collections.min(ll));      
    System.out.println("Maximum: " + Collections.max(ll));          
  }  
}

The output:


List sorted in reverse: 20 8 -8 -20 
List shuffled: 20 -20 -8 8 
Minimum: -20
Maximum: 20

Home
Java Book
Collection

Collections: