package order;
import java.util.Arrays;
/**
* @author:MZH
* @QQ:2563548305
* @Date:2022/9/4 19:57
*/
public class InsertSort {
public static int[] insertSort(int[] array){
//第一个元素为有序区域,从第二个数组元素开始循环
for (int i = 1; i < array.length; i++) {
int insertValue = array[i];
int j=i-1;
//从右向左比较元素的同时,复制元素
for (;(j>=0)&&(insertValue<array[j]);j--){
array[j+1]=array[j];
}
//insertValue的值放入适当位置
array[j+1]=insertValue;
}
return array;
}
public static void main(String[] args) {
int [] array = new int[]{6,1,2,9,7,6,2,8};
int[] ints = insertSort(array);
System.out.println(Arrays.toString(ints));
}
}