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:
Spring’s RequestBody and ResponseBody Annotations
Spring Cloud AWS – RDS
Simultaneous Spring WebClient Calls
Java Program to Find Shortest Path Between All Vertices Using Floyd-Warshall’s Algorithm
Java Program to implement Array Deque
Hướng dẫn Java Design Pattern – Mediator
Java Program to Implement Find all Forward Edges in a Graph
Java Program to Find Hamiltonian Cycle in an UnWeighted Graph
REST Pagination in Spring
Java Program to Use Boruvka’s Algorithm to Find the Minimum Spanning Tree
Receive email using IMAP
Java Program to Generate Date Between Given Range
Removing Elements from Java Collections
Bootstrapping Hibernate 5 with Spring
Testing an OAuth Secured API with Spring MVC
Java Program to Apply DFS to Perform the Topological Sorting of a Directed Acyclic Graph
Spring Security with Maven
Java Program to Implement Queue
Java Program to Implement the Hungarian Algorithm for Bipartite Matching
Java Program to Implement Binary Tree
Mockito and JUnit 5 – Using ExtendWith
Function trong Java 8
OAuth2 Remember Me with Refresh Token
Guide to Selenium with JUnit / TestNG
Java Program to Implement Tarjan Algorithm
Jackson – Unmarshall to Collection/Array
Convert Character Array to String in Java
Jackson JSON Views
Test a REST API with Java
Bootstrap a Web Application with Spring 5
Java Program to implement Circular Buffer
Giới thiệu SOAP UI và thực hiện test Web Service