-
Notifications
You must be signed in to change notification settings - Fork 1.4k
/
Solution.java
36 lines (32 loc) · 1.01 KB
/
Solution.java
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
// github.com/RodneyShag
import java.util.Scanner;
public class Solution {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int s = scan.nextInt();
int[] array = new int[s];
for (int i = 0; i < s; i++) {
array[i] = scan.nextInt();
}
scan.close();
insertionSortPart2(array);
}
public static void insertionSortPart2(int[] array) {
for (int i = 1; i < array.length; i++) {
int j = i;
int value = array[i];
while (j >= 1 && array[j-1] > value) { // find where to insert "value"
array[j] = array[j-1]; // shift the elements (1 by 1) to make room for inserting
j--;
}
array[j] = value;
printArray(array);
}
}
private static void printArray(int[] array) {
for (int num: array) {
System.out.print(num + " ");
}
System.out.println();
}
}