排序算法-（3）直接插入排序

import java.util.Arrays;

import com.sun.accessibility.internal.resources.accessibility;

public class Main {

    public static void main(String[] args){  
        int[] arr = {4,3,6,1,5,2,7,10,9};  
        insertSort(arr);
        System.out.println(Arrays.toString(arr));  
    }  
    
    //直接插入排序
    public static void insertSort(int[] a){
        for(int i = 1 ;i < a.length; i++){
            for(int j = i; j > 0;j--){
                if(a[j] < a[j-1]){
                    swap(a, j, j-1);
                }
            }
        }
    }
    private static void swap(int[] a,int low,int high){  
        int temp = a[low];  
        a[low] = a[high];  
        a[high] = temp;  
    } 
}