List sort(Comparator c):How to sort List

List sort(Comparator<? super E> c) 

public void sort(Comparator<? super E> c)

Description copied from interface: List

Sorts this list according to the order induced by the specified Comparator.
All elements in this list must be mutually comparable using the specified comparator (that is, c.compare(e1, e2) must not throw a ClassCastException for any elements e1 and e2 in the list).

If the specified comparator is null then all elements in this list must implement the Comparable interface and the elements' natural ordering should be used.

This list must be modifiable, but need not be resizable.
Specified by:sort in interface List<E>Parameters:c - the Comparator used to compare list elements. A null value indicates that the elements' natural ordering should be used

For Example:

1. import java.util.ArrayList;
2. import java.util.Comparator;
3. import java.util.List;
4. 
   
5. public class MapDemo {
6. public static void main(String[] args) {
8.   //sort Object type
9. List<Student> list = new ArrayList<Student>();
10. list.add(new Student("Jack", 30));
11. list.add(new Student("Tom", 35));
12. list.add(new Student("ROSE", 20));
13. list.sort(new Comparator<Student>() {
14. @Override
15. public int compare(Student stu1, Student stu2) {
16. //according student age ASC
17. return stu1.getAge().compareTo(stu2.getAge());
18. }
20. });
22. //print student name and age
23. for (Student s : list) {
24. System.out.println(s.getName()+"==="+s.getAge());
25. }
27. //sort basic type 
28. List<Integer> list2 = new ArrayList<Integer>();
29. list2.add(20);
30. list2.add(18);
31. list2.add(30);
32. list2.sort(new Comparator<Integer>() {
33. @Override
34. public int compare(Integer num1, Integer num2) {
35. return num1.compareTo(num2);
36. }
38. });
40. //print number
41. for (Integer num : list2) {
42. System.out.println(num);
43. }
44. }
45. }