This is a Java Program to implement Radix Sort Algorithm. This program is to sort a list of numbers.
Here is the source code of the Java program to implement Radix Sort Algorithm. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.
/**
** Java Program to Implement Radix Sort
**/
import java.util.Scanner;
/** Class RadixSort **/
public class RadixSort
{
/** Radix Sort function **/
public static void sort( int[] a)
{
int i, m = a[0], exp = 1, n = a.length;
int[] b = new int[n];
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;
}
}
/** Main method **/
public static void main(String[] args)
{
Scanner scan = new Scanner( System.in );
System.out.println("Radix Sort Test\n");
int n, i;
/** Accept number of elements **/
System.out.println("Enter number of integer elements");
n = scan.nextInt();
/** Create integer array on n elements **/
int arr[] = new int[ n ];
/** Accept elements **/
System.out.println("\nEnter "+ n +" integer elements");
for (i = 0; i < n; i++)
arr[i] = scan.nextInt();
/** Call method sort **/
sort(arr);
/** Print sorted Array **/
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 10 Enter 10 integer elements 877 567 3456 876 467 26 934 9876 1 4567 Elements after sorting 1 26 467 567 876 877 934 3456 4567 9876
Related posts:
Introduction to the Java NIO Selector
Java Program to Implement Hash Tables Chaining with Doubly Linked Lists
Java Program to Implement Find all Forward Edges in a Graph
Split a String in Java
Spring Boot - Creating Docker Image
A Guide to Queries in Spring Data MongoDB
Guava – Join and Split Collections
Receive email using IMAP
Java Program to Implement Trie
Java Program to Solve Set Cover Problem assuming at max 2 Elements in a Subset
Java Program to Check Whether it is Weakly Connected or Strongly Connected for a Directed Graph
Java Program to Find the Mode in a Data Set
Java Program to Implement Sparse Array
Java 8 – Powerful Comparison with Lambdas
Java Program to Delete a Particular Node in a Tree Without Using Recursion
Base64 encoding và decoding trong Java 8
Java Program to Perform Polygon Containment Test
Java IO vs NIO
Java Program to Implement Nth Root Algorithm
The Registration API becomes RESTful
How to Remove the Last Character of a String?
Hướng dẫn Java Design Pattern – Object Pool
Spring Boot - Apache Kafka
Working with Network Interfaces in Java
Introduction to Spring Data JDBC
A Guide to Spring Cloud Netflix – Hystrix
Java Program to Implement Adjacency List
Java Streams vs Vavr Streams
Lớp TreeMap trong Java
Java Program to Implement Sorted Doubly Linked List
Spring’s RequestBody and ResponseBody Annotations
@Lookup Annotation in Spring