CIYAWASAY

《Bubble Sort》

for i←1 to length[A]
   do for j←length[A] downto i+1
      do if A[j]<A[j-1]
         then exchange A[j]←→A[j-1]

void bubbleSort(int[] Array) {
   int temp;

   for (int i = 0; i < Array.length; i++) {
      for (int j = 0; j < (Array.length - i - 1); j++) {
         if (Array[j].score > Array[j + 1].score) {
            temp = Array[j].score;
            Array[j].score = Array[j + 1].score;
            Array[j + 1].score = temp;
         }
      }
   }
}

void bubbleSort(String[] Array) {
   String temp;

   for (int i = 0; i < Array.length; i++) {
      for (int j = 0; j < (Array.length - i - 1); j++) {
         if (Array[j].name.compareTo(Array[j + 1].name) > 0) {
            temp = Array[j].name;
            Array[j].name = Array[j + 1].name;
            Array[j + 1].name = temp;
         }
      }
   }
}

# posted by SwanBear @ 08:41