forked from sPredictorX1708/Ultimate-Java-Resources
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathExtendedCountingSort.java
More file actions
52 lines (38 loc) · 1.17 KB
/
ExtendedCountingSort.java
File metadata and controls
52 lines (38 loc) · 1.17 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
45
46
47
48
49
50
51
52
public class ExtendedCountingSort {
public void sort(Integer[] array, int leftIndex, int rightIndex) {
if (array.length > 0) {
Integer biggest = biggestInt(array, leftIndex, rightIndex);
Integer smallest = smallestInt(array, leftIndex, rightIndex);
Integer[] c = new Integer[biggest - smallest + 1];
Integer[] b = new Integer[array.length];
Arrays.fill(c, 0);
for (int i = leftIndex; i <= rightIndex; i++) {
c[array[i] - smallest] += 1;
}
for (int i = 1; i < c.length; i++) {
c[i] += c[i - 1];
}
for (int i = rightIndex; i >= leftIndex; i--) {
b[c[array[i] - smallest] - 1] = array[i];
c[array[i] - smallest] -= 1;
}
for (int i = 0; i < b.length; i++) {
array[i] = b[i];
}
}
}
private Integer smallestInt(Integer[] array, int leftIndex, int rightIndex) {
int m = array[leftIndex];
for (int i = leftIndex; i <= rightIndex ; i++) {
if (array[i] < m) { m = array[i]; }
}
return m;
}
private Integer biggestInt(Integer[] array, int leftIndex, int rightIndex) {
int k = array[leftIndex];
for (int i = leftIndex; i <= rightIndex ; i++) {
if (array[i] > k) { k = array[i]; }
}
return k;
}
}