将学生按照年龄排序……

存储学生对象并比遍历，
要求：按照年龄从小到大排序，年龄相同时，按照姓名的字母顺序排序

创建学生类

public class Student {
	private String name;
	private int age;
	public String getName() {
		return name;
	}
	public void setName(String name) {
		this.name = name;
	}
	public int getAge() {
		return age;
	}
	public void setAge(int age) {
		this.age = age;
	}
	public Student(){}
	
	public Student(String name, int age) {
		this.name = name;
		this.age = age;
	}
	
	

方法一使用TreeSet集合，存储对象并排列:

public class TreeSetDemo {
	public static void main(String[] args) {
		TreeSet<Student> ts = new TreeSet<Student>(new Comparator<Student>(){

			@Override
			public int compare(Student s1, Student s2) {
				//
				int num = s1.getAge() - s2.getAge();
				int num2 = num==0?s1.getName().compareTo(s2.getName()) : num;
				return num2;
			}			
		});
		
		Student s1 = new Student("xioazhang",22);
		Student s2 = new Student("xiaowang",29);
		Student s3 = new Student("zhansan",24);
		Student s4 = new Student("Ethreal",25);
		Student s5 = new Student("lisi",22);
		
		ts.add(s1);
		ts.add(s2);
		ts.add(s3);
		ts.add(s4);
		ts.add(s5);
		
		for(Student s : ts){
			System.out.println(s.getName()+","+s.getAge());
		}
		
	}

}

方法二:使用ArrayList集合、Collections.sort()、此时要比较器comparator：

public static void main(String[] args) {
		ArrayList<Student> array = new ArrayList<Student>();
		
		Student s1 = new Student("xioazhang",22);
		Student s2 = new Student("xiaowang",29);
		Student s3 = new Student("zhansan",24);
		Student s4 = new Student("Ethreal",25);
		Student s5 = new Student("lisi",22);
		
		array.add(s1);
		array.add(s2);
		array.add(s3);
		array.add(s4);
		array.add(s5);
		
		Collections.sort(array, new Comparator<Student>(){
			@Override
			public int compare(Student o1, Student o2) {
				int num = o1.getAge()-o2.getAge();
				int num2 = num == 0?o1.getName().compareTo(o2.getName()) : num;
				return num2;
			}			
		});
		
		//遍历
		for(Student s : array){
			System.out.println(s.getName()+","+s.getAge());
		}
		
	}