Implement the radix sort, by using a
queuefor each bucket. The code for the radix sort is below:
import java. util. Scanner;
public class Main {
public static void sort(int[] a) {
int i, m = a[0], exp = 1, n = a. length;
int[] b = new int[10];
for (i = 1; i <>
if (a[i] > m) {
m = a[i];
}
}
while (m / exp > 0) {
int[] bucket = new int[10];
for (i = 0; i <>
for (i = 1; i <>
for (i = n - 1; i >= 0; i--) b[--bucket[(a[i] / exp) % 10]] = a[i];
for (i = 0; i <>
exp *= 10;
}
} public static void main(String[] args) {
Scanner scan = new Scanner(System .in);
System .out. print ln("Radix Sort Test\n");
int n, i;/** Accept number of elements **/System .out. print ln("Enter number of integer elements");
n = scan .next Int();/** Create integer array on n elements **/
int arr[] = new int[n];/** Accept elements **/System. out. print ln("\n Enter " + n + " integer elements");
for (i = 0; i <>/** Call method sort **/sort(arr);/** Print sorted Array **/
System.
out. print ln("\n Elements after sorting ");
for (i = 0; i <>
System.
out. print(arr[i] + " ");
}
System .out. print ln();
}
}