Java-Sort-Algorithms/InsertionSort.java at master · mattryanmtl/Java-Sort-Algorithms · GitHub

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
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
importjava.util.Scanner;


/* Class InsertionSort */

publicclassInsertionSort

{

/* Insertion Sort function */

publicstaticvoidsort( intarr[] )

 {

intN = arr.length;

inti, j, temp;

for (i = 1; i< N; i++)

 {

j = i;

temp = arr[i];

while (j > 0 && temp < arr[j-1])

 {

arr[j] = arr[j-1];

j = j-1;

 }

arr[j] = temp;

 }

 }

/* Main method */

publicstaticvoidmain(String[] args)

 {

Scannerscan = newScanner( System.in );

System.out.println("Insertion Sort Test\n");

intn, i;

/* Accept number of elements */

System.out.println("Enter number of integer elements");

n = scan.nextInt();

/* Create integer array on n elements */

intarr[] = newint[ n ];

/* Accept elements */

System.out.println("\nEnter "+ n +" integer elements");

for (i = 0; i < n; i++)

arr[i] = scan.nextInt();

/* Call method sort */

sort(arr);

/* Print sorted Array */

System.out.println("\nElements after sorting ");

for (i = 0; i < n; i++)

System.out.print(arr[i]+" ");

System.out.println();

 }

}