package Sort;
public class InsertSort {
public static void main(String[] args) {
int[] a = { 57, 68, 59, 52 };
insertSort(a);
print(a);
}
// 打印函数
public static void print(int[] numbers) {
for (int i = 0; i < numbers.length; i++) {
System.out.println(numbers[i]);
}
}
public static void insertSort(int[] arr) {
for (int i = 1; i < arr.length; i++) {
int tmp = arr[i];
int j;
for (j = i - 1; j >= 0; j--) {
if (arr[j] > tmp) {
arr[j + 1] = arr[j];
} else {
arr[j + 1] = tmp;
break;
}
}
if (j == -1) {
arr[j + 1] = tmp;
}
}
}
}
public class InsertSort {
public static void main(String[] args) {
int[] a = { 57, 68, 59, 52 };
insertSort(a);
print(a);
}
// 打印函数
public static void print(int[] numbers) {
for (int i = 0; i < numbers.length; i++) {
System.out.println(numbers[i]);
}
}
public static void insertSort(int[] arr) {
for (int i = 1; i < arr.length; i++) {
int tmp = arr[i];
int j;
for (j = i - 1; j >= 0; j--) {
if (arr[j] > tmp) {
arr[j + 1] = arr[j];
} else {
arr[j + 1] = tmp;
break;
}
}
if (j == -1) {
arr[j + 1] = tmp;
}
}
}
}