-
Notifications
You must be signed in to change notification settings - Fork 1.8k
/
AmericanFlagSort.java
96 lines (89 loc) · 3.14 KB
/
AmericanFlagSort.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
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
92
93
94
95
96
package com.jwetherell.algorithms.sorts;
/**
* An American flag sort is an efficient, in-place variant of radix sort that
* distributes items into hundreds of buckets. Non-comparative sorting
* algorithms such as radix sort and American flag sort are typically used to
* sort large objects such as strings, for which comparison is not a unit-time
* operation.
* <p>
* Family: Bucket.<br>
* Space: In-place.<br>
* Stable: False.<br>
* <p>
* Average case = O(n*k/d)<br>
* Worst case = O(n*k/d)<br>
* Best case = O(n*k/d)<br>
* <p>
* NOTE: n is the number of digits and k is the average bucket size
* <p>
* @see <a href="https://en.wikipedia.org/wiki/American_flag_sort">American Flag Sort (Wikipedia)</a>
* <br>
* @author Justin Wetherell <[email protected]>
*/
public class AmericanFlagSort {
private static final int NUMBER_OF_BUCKETS = 10; // 10 for base 10 numbers
private AmericanFlagSort() { }
public static Integer[] sort(Integer[] unsorted) {
int numberOfDigits = getMaxNumberOfDigits(unsorted); // Max number of digits
int max = 1;
for (int i = 0; i < numberOfDigits - 1; i++)
max *= 10;
sort(unsorted, 0, unsorted.length, max);
return unsorted;
}
public static void sort(Integer[] unsorted, int start, int length, int divisor) {
// First pass - find counts
int[] count = new int[NUMBER_OF_BUCKETS];
int[] offset = new int[NUMBER_OF_BUCKETS];
int digit = 0;
for (int i = start; i < length; i++) {
int d = unsorted[i];
digit = getDigit(d, divisor);
count[digit]++;
}
offset[0] = start + 0;
for (int i = 1; i < NUMBER_OF_BUCKETS; i++) {
offset[i] = count[i - 1] + offset[i - 1];
}
// Second pass - move into position
for (int b = 0; b < NUMBER_OF_BUCKETS; b++) {
while (count[b] > 0) {
int origin = offset[b];
int from = origin;
int num = unsorted[from];
unsorted[from] = -1;
do {
digit = getDigit(num, divisor);
int to = offset[digit]++;
count[digit]--;
int temp = unsorted[to];
unsorted[to] = num;
num = temp;
from = to;
} while (from != origin);
}
}
if (divisor > 1) {
// Sort the buckets
for (int i = 0; i < NUMBER_OF_BUCKETS; i++) {
int begin = (i > 0) ? offset[i - 1] : start;
int end = offset[i];
if (end - begin > 1)
sort(unsorted, begin, end, divisor / 10);
}
}
}
private static int getMaxNumberOfDigits(Integer[] unsorted) {
int max = Integer.MIN_VALUE;
int temp = 0;
for (int i : unsorted) {
temp = (int) Math.log10(i) + 1;
if (temp > max)
max = temp;
}
return max;
}
private static int getDigit(int integer, int divisor) {
return (integer / divisor) % 10;
}
}