forked from janbodnar/Java-Advanced
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathInsertionSortEx.java
More file actions
44 lines (30 loc) · 1.02 KB
/
InsertionSortEx.java
File metadata and controls
44 lines (30 loc) · 1.02 KB
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
package com.zetcode;
import java.util.Arrays;
/* Insertion sort is a simple sorting algorithm;
much less efficient on large lists than more advanced algorithms
such as quick sort, heap sort, or merge sort.
Efficient for (quite) small data sets */
// similar to sorting cards
public class InsertionSortEx {
public static void main(String[] args) {
int[] values = {3, 7, 1, 15, 12, 6, 11, 9};
System.out.println(Arrays.toString(values));
sort(values);
System.out.println(Arrays.toString(values));
}
private static void sort(int a[]) {
int len = a.length;
// we start with the second element as key
for (int i = 1; i < len; i++) {
int key = a[i];
int j = i - 1;
// Move elements that are greater than key, to one
// position ahead of their current position
while (j >= 0 && a[j] > key) {
a[j + 1] = a[j];
j = j - 1;
}
a[j + 1] = key;
}
}
}