插入排序
public class InsertionSort {
public static void main(String[] args) {
int[] arr = {5, 1, 44, 5, 58, 33};
System.out.println(Arrays.toString(arr));
sort(arr);
}
public static void sort(int[] arr) {
for (int i = 1; i < arr.length; i++) {
int temp = arr[i];
int j = i;
while (j > 0 && arr[j - 1] > temp) {
arr[j] = arr[j - 1];
j--;
}
arr[j] = temp;
}
System.out.println(Arrays.toString(arr));
}
public static void sort3(int[] arr) {
for (int i = 1; i < arr.length; i++) {
for (int j = i; j > 0; j--) {
if (arr[j - 1] > arr[j]) {
swap(arr, j, j - 1);
}
}
}
}
public static void swap(int[] arr, int i, int j) {
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}