一个简单的冒泡排序

public class JDBC {
    public static void main(String[]args){
        Student stu  = new Student("张三",1,80);
        Student stu1  = new Student("李四",2,60);
        Student stu2  = new Student("王五",3,77);
        Student stu3  = new Student("赵六",4,90);
        ArrayList<Student> list = new ArrayList<>();
        list.add(stu);
        list.add(stu1);
        list.add(stu2);
        list.add(stu3);

        //冒泡排序
        for (int i = 0; i < list.size()-1; i++) {
            for (int j = 0; j < list.size()-1-i; j++) {
                //建立对象接收集合中的Student
                Student s = list.get(j);
                Student s1 = list.get(j+1);
                //比较成绩
                if(s.getScore()>s1.getScore()){
                    list.set(j, s1);
                    list.set(j+1, s);
                }
            }
        }
        for(Student st : list){
            System.out.println(st);
        }
    }
}

class Student{
    private String name;
    private int id;
    private int score;
    public String getName() {
        return name;
    }
    public void setName(String name) {
        this.name = name;
    }
    public int getId() {
        return id;
    }
    public void setId(int id) {
        this.id = id;
    }
    public int getScore() {
        return score;
    }
    public void setScore(int score) {
        this.score = score;
    }
    public Student(String name, int id, int score) {
        super();
        this.name = name;
        this.id = id;
        this.score = score;
    }
    public Student() {
        super();
        // TODO Auto-generated constructor stub
    }
    @Override
    public String toString() {
        return "Student [name=" + name + ", id=" + id + ", score=" + score + "]";
    }

}

执行结果：