This repository was archived by the owner on Mar 10, 2024. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathRadixSort.java
More file actions
50 lines (46 loc) · 1.51 KB
/
Copy pathRadixSort.java
File metadata and controls
50 lines (46 loc) · 1.51 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
import java.util.Arrays;
public class RadixSort {
// The main function to that sorts arr[] of size n using
// Radix Sort
public static void Rsort(int[] array, int n) {
// Find the maximum number to know number of digits
int m = getMax(array, n);
// Do counting sort for every digit. Note that
// instead of passing digit number, exp is passed.
// exp is 10^i where i is current digit number
for (int exp = 1; m / exp > 0; exp *= 10)
countSort(array, n, exp);
}
// A utility function to get maximum value in array[]
private static int getMax(int array[], int n) {
int mx = array[0];
for (int i = 1; i < n; i++)
if (array[i] > mx)
mx = array[i];
return mx;
}
// A function to do counting sort of array[] according to
// the digit represented by exp.
private static void countSort(int[] array, int n, int exp) {
int[] output = new int[n]; // output array
int i;
int[] count = new int[10];
Arrays.fill(count, 0);
// Store count of occurrences in count[]
for (i = 0; i < n; i++)
count[(array[i] / exp) % 10]++;
// Change count[i] so that count[i] now contains
// actual position of this digit in output[]
for (i = 1; i < 10; i++)
count[i] += count[i - 1];
// Build the output array
for (i = n - 1; i >= 0; i--) {
output[count[(array[i] / exp) % 10] - 1] = array[i];
count[(array[i] / exp) % 10]--;
}
// Copy the output array to array[], so that array[] now
// contains sorted numbers according to current digit
for (i = 0; i < n; i++)
array[i] = output[i];
}
}