Question

JAVA PLEASE

Using queues

Radix sort

Come up with an unsorted array of numbers (integer array). Sort the numbers in ascending order and descending order and display them using radix sort.

First sort in ascending, then reset the array to its original order and finally sort the array again in descending order.

Answer 1

Solution =>

import java.util.*;
class Radix_Sort {
public static void main(String[] args) {
int i;
Scanner sc = new Scanner(System.in); //if you want to input array by yourself
int[] a = {96,23,109,45,65,23,67,89,39,11};
int[] b = a;
radix_sort_asc(a);
System.out.println("\n The sorted array in ascending order is: \n");
for(i=0;i<10;i++)
System.out.print(a[i] + " ");
System.out.println();
a = b; // resetting the array
radix_sort_desc(a);
System.out.println("\n The sorted array in descending order is: \n");
for(i=0;i<10;i++)
System.out.print(a[i]+ " ");
}
  
static int largest(int a[])
{   
int larger=a[0], i;   
for(i=1;i<10;i++)
{
if(a[i]>larger)
larger = a[i];
}
return larger;
}
static void radix_sort_asc(int a[]) // ascending order radix sort function
{
int n = a.length;
int MAX = largest(a);
int i, m=0, exp=1;
int b[] = new int[MAX];
for (i=0; i<n; i++)
{
if (a[i]>m)
m=a[i];
}
while (m/exp>0)
{
int bucket[]=new int[10];
for (i=0; i<n; i++)
bucket[a[i]/exp%10]++;
for (i=1; i<10; i++)
bucket[i]+=bucket[i-1];
for (i=n-1; i>=0; i--)
b[--bucket[a[i]/exp%10]]=a[i];
for (i=0; i<n;i++){
a[i]=b[i];
}
exp*=10;
}
}
static void radix_sort_desc(int a[]) // Descending order radix sort function
{int n = a.length;
int MAX = largest(a);
int i, m=0, exp=1;
int b[] = new int[MAX];
for (i=0; i<n; i++)
if (a[i]>m)
m=a[i];
while (m/exp>0)
{
int bucket[]=new int[10];
for (i=0; i<n; i++)
bucket[9-a[i]/exp%10]++; // changed this line
for (i=1; i<10; i++)
bucket[i]+=bucket[i-1];
for (i=n-1; i>=0; i--)
b[--bucket[9-a[i]/exp%10]]=a[i]; // changed this line
for (i=0; i<n;i++){
a[i]=b[i]; // changed this line
}
exp*=10;
}
}
  
}