Radix Sort Java Program and Algorithm

This instructional exercise is about radix sort java program and calculation.

Here is an exceptionally essential and point by point depiction of calculation that we pursue to execute the radix sort in java.

We generally depend on the spot estimation of digits to sift through it in the given rundown. In this way,

our first fundamental assignment is to discover the number with the most extreme length and afterwards emphasize the entire circle over the length of the digit.

Next, we mastermind each number considering 1s spot esteem, 10s spot esteem, 100s spot esteem, etc till the length of the most extreme digit.

Radix Sort Java Algorithm

1. Discover the length of the number that has the most extreme number of digits.
2. Instate i=0, Repeat the beneath strategy till the length approaches me.
3. Fill the container with every one of the digits in ith position.
4. Sort out the digits as per the request.
5. In the event that length=i, i=i*10, goto to stage 3. Else go to stage 5
6. Print the arranged cluster.

Unpredictability

The unpredictability of Radix Sort is much better than that of air pocket sort and some other arranging methods. It is as appeared beneath relies upon d and b.

O (d*(n+b))

d is digits in input whole numbers.

b is the base for speaking to numbers.

Clarification

Give us a chance to begin the execution of the program. First we characterize a class named RadixSort and clearly it has just a single strategy named sort to sort the numbers given.

This capacity is the focal piece of talk and as usual, we take the contributions for the client utilizing the fundamental capacity and give it to the arranging capacity. The beneath code scrap shows it.

Scanner scan = new Scanner( System.in );
 
System.out.println("Radix Sort Test\n");
int n, i;
 
System.out.println("Enter number of integer elements");
n = scan.nextInt();
int arr[] = new int[ n ];
 
System.out.println("\nEnter "+ \n +" integer elements");
for (i = 0; i < n; i++)
	arr[i] = scan.nextInt();
 
sort(arr);

You can see that the capacity that we are going to actualize doesn’t return anything as its arrival type is void.

It takes in an unsorted cluster of numbers and sorts it. Presently we will examine the calculation to actualize the sort work.

The calculation says we have to initially locate the number of digits in the longest number.

for (i = 1; i < n; i++)
            if (a[i] > m)
                m = a[i];

Utilizing the above for circle we can locate the limit of the considerable number of numbers.

Rather than discovering its length, we will repeat some time circle until the most extreme number falls beneath zero by partitioning the number by 10 for each emphasis.

At that point sort the cluster utilizing a transitory container and exhibit b[ ] and place back the last substance.

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;        
        }

Radix Sort Java Program

import java.util.Scanner;
 
class RadixSort 
{
    static void sort( int[] a)
    {
        int i, m = a[0], exp = 1, n = a.length;
        int[] b = new int[10];
        
        for (i = 1; 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;        
        }
    }    
    
    public static void main(String[] args) 
    {
        Scanner scan = new Scanner( System.in );        
        System.out.println("Radix Sort Testn");
        
        int n, i;
        System.out.println("Enter number of integer elements");
        
        n = scan.nextInt();
        int arr[] = new int[ n ];
        
        System.out.println("\nEnter "+ n +" integer elements");
        for (i = 0; i < n; i++)
            arr[i] = scan.nextInt();
        
        sort(arr);
        
        System.out.println("\nElements after sorting ");        
        for (i = 0; i < n; i++)
            System.out.print(arr[i]+" ");            
        
        System.out.println();                     
    }    
}

Output

Radix Sort Test

Enter number of integer elements
6

Enter 6 integer elements
12 9 15 4 0 1

Elements after sorting
0 1 4 9 12 15

Remark underneath on the off chance that you have inquiries or discovered anything off base in above radix sort java program and calculation.