几种简单排序（java）

public class EasySort {

static int[] arr = new int[] { 44, 12, 22, 3, 8, 10, 15 };

public static void main(String[] args) {
display(arr);
// ========================================================
bubbleSort();
selectSort();
insertSort();
// ========================================================
display(arr);
}

// 冒泡排序
public static void bubbleSort() {
for (int i = arr.length - 1; i >= 0; i--) {
for (int j = 0; j < i; j++) {
if (arr[j] > arr[j + 1]) {
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
}

// 选择排序
public static void selectSort() {
for (int i = 0; i < arr.length - 1; i++) {
for (int j = i + 1; j < arr.length; j++) {
if (arr[i] > arr[j]) {
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
}
}

//插入排序
public static void insertSort() {

for (int i = 1; i < arr.length; i++) {
int temp = arr[i];
int flag = i - 1;
while (flag >= 0) {
if (temp < arr[flag]) {
arr[flag + 1] = arr[flag];
flag--;
}else {
break;
}
}
arr[flag+1] = temp;
}

}

public static void display(int[] arr) {
for (int i = 0; i < arr.length; i++)
System.out.print(arr[i] + " ");
System.out.println();
}

}