package arrays.myArray;
public class SortArr {
public static void main(String[] args) {
int[] arrInt = { 4, 7, 8, 5, 6, 3, 2, 3, 4 };
maoPaoSort(arrInt);
print("冒泡排序：", arrInt);
arrInt = new int[]{ 4, 7, 8, 5, 6, 3, 2, 3, 4 };
insertSort(arrInt);
print("插入排序：", arrInt);
arrInt = new int[]{ 4, 7, 8, 5, 6, 3, 2, 3, 4 };
checkSort(arrInt);
print("选择排序：", arrInt);
}
// 冒泡排序
private static void maoPaoSort(int[] arrInt) {
int temp = 0;
for (int i = 0; i < arrInt.length; i++) {
for (int j = 0; j < arrInt.length - 1; j++) {
if (arrInt[i] < arrInt[j]) {
temp = arrInt[i];
arrInt[i] = arrInt[j];
arrInt[j] = temp;
}
}
}
}
// 插入排序
private static void insertSort(int[] arrInt) {
//倒数第二个开始比较
for (int i = arrInt.length - 2; i >= 0; i--) {
int j = 0;
for (j = arrInt.length - 1; j > i; j--) {
if (arrInt[i] > arrInt[j]) {
break;
}
}
int temp = arrInt[i];
for (int k = i; k < j; k++) {
arrInt[k] = arrInt[k + 1];
}
arrInt[j] = temp;
}
//正数第二个开始比较
/*for (int i = 1; i < arrInt.length; i++) {
int j = 0;
for (j = 0; j < arrInt.length - 1; j++) {
if (arrInt[i] > arrInt[j]) {
break;
}
}
&nbs
