Java Program to sort Integer list in reversed order

Following is our integer array:

Integer[] arr = {20, 50, 100, 150, 200, 250, 300, 350, 400, 500};

Now convert the above Integer array to List:

List<Integer> list = new ArrayList<>(Arrays.asList(arr));

Now, to sort the above Integer list in reversed order:

Comparator<Integer> initialComp = Integer::compare;
Comparator<Integer> revComp = initialComp.reversed();
Collections.sort(list, revComp);

The following is an example to sort Integer list in reversed order:

Example

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;
public class Demo {
   public static void main(String[] args) {
      Integer[] arr = {20, 50, 100, 150, 200, 250, 300, 350, 400, 500};
      List<Integer> list = new ArrayList<>(Arrays.asList(arr));
      System.out.println("Integer List = "+list);
      Comparator<Integer> initialComp = Integer::compare;
      Comparator<Integer> revComp = initialComp.reversed();
      Collections.sort(list, revComp);
      System.out.println("Integer in reversed order...");
      list
         .stream()
         .forEach(c -> System.out.print(c + "\n"));
   }
}

Output

Integer List = [20, 50, 100, 150, 200, 250, 300, 350, 400, 500]
Integer in reversed order...
500
400
350
300
250
200
150
100
50
20