1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73

import java.util.Arrays;








public class InsertionSort {


    public static void main(String[] args) {
        int[] a = {1, 4, 8, 2, 5};

        insertSort1(a);
        System.out.println(Arrays.toString(a));


        int[] aa = {1, 4, 8, 2, 5};
        insertSort2(aa);
        System.out.println(Arrays.toString(aa));
    }

    



    private static void insertSort2(int[] a) {
        for (int i =0 ; i<a.length-1;i++){
            for(int j=i+1;j>0;j--){
                if (a[j-1]>a[j]){
                    
                    int temp = a[j];
                    a[j]=a[j-1];
                    a[j-1]=temp;
                }else {
                    
                    break;
                }
            }
        }
    }

    



    private static void insertSort1(int[] a) {
        for (int i = 1; i < a.length; i++) {
            
            int temp = a[i];
            
            for (int j = i; j >= 0; j--) {
                
                
                if (j > 0 && a[j - 1] > temp) {
                    a[j] = a[j - 1];
                    
                    
                } else {
                    
                    a[j] = temp;
                    
                    break;
                }
            }
        }

    }

}