algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2026-03-13 08:40:43 +08:00
Code Issues Packages Projects Releases Wiki Activity

Formatted with Google Java Formatter

Browse Source
This commit is contained in:
github-actions
2020-10-24 10:23:28 +00:00
parent a23bac99e8
commit 5d59a2e828
219 changed files with 13758 additions and 14582 deletions
Download Patch File Download Diff File Expand all files Collapse all files

78
Sorts/RadixSort.java
View File

@@ -4,56 +4,46 @@ import java.util.Arrays;
class RadixSort {
private static int getMax(int[] arr, int n) {
int mx = arr[0];
for (int i = 1; i < n; i++)
if (arr[i] > mx)
mx = arr[i];
return mx;
private static int getMax(int[] arr, int n) {
int mx = arr[0];
for (int i = 1; i < n; i++) if (arr[i] > mx) mx = arr[i];
return mx;
}
private static void countSort(int[] arr, int n, int exp) {
int[] output = new int[n];
int i;
int[] count = new int[10];
Arrays.fill(count, 0);
for (i = 0; i < n; i++) count[(arr[i] / exp) % 10]++;
for (i = 1; i < 10; i++) count[i] += count[i - 1];
for (i = n - 1; i >= 0; i--) {
output[count[(arr[i] / exp) % 10] - 1] = arr[i];
count[(arr[i] / exp) % 10]--;
}
private static void countSort(int[] arr, int n, int exp) {
int[] output = new int[n];
int i;
int[] count = new int[10];
Arrays.fill(count, 0);
for (i = 0; i < n; i++) arr[i] = output[i];
}
for (i = 0; i < n; i++)
count[(arr[i] / exp) % 10]++;
private static void radixsort(int[] arr, int n) {
for (i = 1; i < 10; i++)
count[i] += count[i - 1];
int m = getMax(arr, n);
for (i = n - 1; i >= 0; i--) {
output[count[(arr[i] / exp) % 10] - 1] = arr[i];
count[(arr[i] / exp) % 10]--;
}
for (int exp = 1; m / exp > 0; exp *= 10) countSort(arr, n, exp);
}
for (i = 0; i < n; i++)
arr[i] = output[i];
}
static void print(int[] arr, int n) {
for (int i = 0; i < n; i++) System.out.print(arr[i] + " ");
}
private static void radixsort(int[] arr, int n) {
int m = getMax(arr, n);
for (int exp = 1; m / exp > 0; exp *= 10)
countSort(arr, n, exp);
}
static void print(int[] arr, int n) {
for (int i = 0; i < n; i++)
System.out.print(arr[i] + " ");
}
public static void main(String[] args) {
int[] arr = {170, 45, 75, 90, 802, 24, 2, 66};
int n = arr.length;
radixsort(arr, n);
print(arr, n);
}
public static void main(String[] args) {
int[] arr = {170, 45, 75, 90, 802, 24, 2, 66};
int n = arr.length;
radixsort(arr, n);
print(arr, n);
}
}
// Written by James Mc Dermott(theycallmemac)