1.直接插入排序,稳定
1.1图示:
1.2题解
import java.util.Arrays;
public class inserSort {
public static void insertSort(int[] array) {
for (int i = 1; i < array.length; i++) {
int tmp = array[i];
int j = i - 1;
for (; j >= 0; j--) {
if (array[j] > tmp) {
array[j + 1] = array[j];
} else {
break;
}
}
array[j + 1] = tmp;
}
}
public static void main(String[] args) {
int[] array = {8, 4, 7, 9, 3};
insertSort(array);
System.out.println(Arrays.toString(array));
}
}
2.希尔排序
import java.util.Arrays;
public class shellsort {
public static void shell(int[] array, int gap) {
for (int i = gap; i < array.length; i++) {
int tmp = array[i];
int j = i - gap;
for (; j >=0; j =j-gap) {
if (array[j] > tmp) {
array[j + gap] = array[j];
}
else {
break;
}
}
array[j + gap] = tmp;
}
}
public static void shellSort(int[] array) {
int[] drr = {5, 3, 1};
for (int i = 0; i < drr.length; i++) {
shell(array, i);
}
}
public static void main(String[] args) {
int[] array = {8, 4, 7, 9, 3};
shellSort(array);
System.out.println(Arrays.toString(array));
}
}