插入排序【马士兵课程】

public class InsertionSort {
    public static void main(String[] args) {
        int[] a = {9,3,1,4,6,8,7,5,2};
        sort(a);
        print(a);
    }
    static void sort(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);
            }
        }
    }
    static void swap(int[] a, int i, int j){
        int temp = a[i];
        a[i] = a[j];
        a[j] = temp;
    }
    static  void print(int[] arr){
        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i]+" ");
        }
    }
}

标签：arr,int,插入排序,课程,static,swap,士兵,print,void
来源： https://blog.csdn.net/weixin_44527253/article/details/122393001