java 冒泡排序

  for (int i = alllen; i > 0; i--) {
   for (int j = 0; j < i - 1; j++) {
    if (allEmployee[j].dexMoney < allEmployee[j + 1].dexMoney) {
     temp = allEmployee[j];
     allEmployee[j] = allEmployee[j + 1];
     allEmployee[j + 1] = temp;
    }
   }
  }