如何用冒泡发写这个函数题啊

public void sort(Person[] persons) {
int n = persons.length;
  for(int i = 0; i < n; i++) {
  for(int j = 0; j < n - i -1; j++){
    if(persons[j].getId() > persons[j+1].getId())  {
        Person tmp = persons[j];
        persons[j] = persons[j+1];
        persons[j+1] = tmp;
    }  
  }
}
}

直接用工具类的话：

        Arrays.sort(persons, new Comparator<Person>() {
            public int compare(Person p1, Person p2) {
                return p1.id-p2.id;
            }
        });