-
Notifications
You must be signed in to change notification settings - Fork 1.4k
/
Solution.java
37 lines (33 loc) · 991 Bytes
/
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
37
// 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();
insertionSort(array);
}
/* Task: Find bug in HackerRank's insertionSort function below */
public static void insertionSort(int[] A) {
for (int i = 1; i < A.length; i++) {
int value = A[i];
int j = i - 1;
while (j >= 0 && A[j] > value) { // fixed bug on this line
A[j + 1] = A[j];
j = j - 1;
}
A[j + 1] = value;
}
printArray(A);
}
private static void printArray(int[] array) {
for (int num: array) {
System.out.print(num + " ");
}
System.out.println();
}
}