public final class LSBRadixSorter
extends java.lang.Object
Modifier and Type | Field and Description |
---|---|
private int[] |
buffer |
private int[] |
histogram |
private static int |
HISTOGRAM_SIZE |
private static int |
INSERTION_SORT_THRESHOLD |
Constructor and Description |
---|
LSBRadixSorter() |
Modifier and Type | Method and Description |
---|---|
private static void |
buildHistogram(int[] array,
int len,
int[] histogram,
int shift) |
private static void |
insertionSort(int[] array,
int off,
int len) |
private static void |
reorder(int[] array,
int len,
int[] histogram,
int shift,
int[] dest) |
private static boolean |
sort(int[] array,
int len,
int[] histogram,
int shift,
int[] dest) |
void |
sort(int numBits,
int[] array,
int len)
Sort
array[0:len] in place. |
private static void |
sumHistogram(int[] histogram) |
private static final int INSERTION_SORT_THRESHOLD
private static final int HISTOGRAM_SIZE
private final int[] histogram
private int[] buffer
private static void buildHistogram(int[] array, int len, int[] histogram, int shift)
private static void sumHistogram(int[] histogram)
private static void reorder(int[] array, int len, int[] histogram, int shift, int[] dest)
private static boolean sort(int[] array, int len, int[] histogram, int shift, int[] dest)
private static void insertionSort(int[] array, int off, int len)
public void sort(int numBits, int[] array, int len)
array[0:len]
in place.numBits
- how many bits are required to store any of the values in
array[0:len]
. Pass 32
if unknown.