氣泡排序,插入排序,選擇排序(java)
阿新 • • 發佈:2018-12-11
package ch02; public class BubbleSort { public static void sort(long[] arr) { long temp = 0; for(int i = 0; i < arr.length - 1; i ++) { for (int j = arr.length - 1; j > 0; j --) { if (arr[j] < arr[j - 1]) { //交換 temp = arr[j]; arr[j] = arr[j - 1]; arr[j - 1] = temp; } } } } }
package ch02;
public class InsertSort {
public static void sort(long[] arr) {
long tmp = 0;
for(int i = 1; i < arr.length; i ++) {
tmp = arr[i];
int j = i;
while(j > 0 && arr[j] >= tmp) {
arr[j] = arr[j - 1];
j --;
}
arr[j] = tmp;
}
}
}
package ch02; public class SelectionSort { public static void sort(long[] arr) { int k =0; long temp = 0; for(int i = 0; i < arr.length -1; i++) { k = i; for(int j = i; j < arr.length; j ++) { if(arr[j] < arr[k]) { k = j; } } temp = arr[i]; arr[i] = arr[k]; arr[k] = temp; } } }