0～100で20個の乱数、偶数を並べ替えます

import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Random;


/**
* @author WilliamRong
*
*/

public class test {

public static void main(String[] args) {
   // TODO Auto-generated method stub
   List<Integer> intList = new ArrayList<Integer>();

   List<Integer> intList2 = new ArrayList<Integer>();

   Random random = new Random();

   for (int i = 1; i <= 20; i++) {

    int j = random.nextInt(100);

    intList.add(j);

    System.out.println(j);
   }

   for (int i = 0; i < intList.size(); i++) {

    if (intList.get(i) % 2 == 0) {

     intList2.add(intList.get(i));
    }

   }

   System.out.println("----------------------------------");

   for (int i = 0; i < intList2.size(); i++) {

    System.out.println(intList2.get(i));

   }

   System.out.println("----------------------------------");
  
   Collections.sort(intList2);//  

   Collections.sort(intList2, Collections.reverseOrder());//  

   for (int i = 0; i < intList2.size(); i++) {

    System.out.println(intList2.get(i));

   }

}

}