插入排序

package arithmetic;/* * 插入排序 */public class Insertion {    public static int[] insertionSort(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;        }        return arr;    }    public static void main(String[] args) {        int []arr={1,6,2,3,6,8,1,22};        arr=insertionSort(arr);        for (int i = 0; i < arr.length; i++) {            System.out.println(arr[i]);        }    }}