ソートと最適化の挿入(java実装)

1.ソートの挿入

public class InsertionSort {

    public static void sort(int[] arr) {

        int n = arr.length;
        for (int i = 1; i < n; i++) {
            for (int j = i; j > 0; j--) {
                if (arr[j] < arr[j - 1]) {
                    swap(arr, j, j - 1);
                }
            }
        }
    }

    private static void swap(int[] arr, int j, int i) {
        int t = arr[i];
        arr[i] = arr[j];
        arr[j] = t;
    }

2.ソート最適化の挿入

public class InsertionSort {

    public static void sort(int[] arr) {

        int n = arr.length;
        for (int i = 1; i < n; i++) {

            int e = arr[i];
            int j ;
            for (j = i;j>0&&arr[j-1]>e;j--) {
                arr[j] = arr[j-1];
            }
            arr[j] = e;
        }
    }

public static void main(String[] args) {
        int[] arr = {5,3,1,4,2};
        InsertionSort.sort(arr);
        for( int i = 0 ; i < arr.length ; i ++ ){
            System.out.print(arr[i]);
        }
    }