Java Program to Perform the Sorting Using Counting Sort

This is a java program to sort the numbers using the Counting Sort Technique. In computer science, counting sort is an algorithm for sorting a collection of objects according to keys that are small integers; that is, it is an integer sorting algorithm. It operates by counting the number of objects that have each distinct key value, and using arithmetic on those counts to determine the positions of each key value in the output sequence. Its running time is linear in the number of items and the difference between the maximum and minimum key values.

Here is the source code of the Java Program to Perform the Sorting Using Counting Sort. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.

//This is a java program to sort numbers using counting sort
import java.util.Random;
 
public class Counting_Sort 
{
    public static int N = 20;
    public static int[] sequence = new int[N];
    private static final int MAX_RANGE = 1000000;
 
    public static void sort(int[] arr) 
    {
        int N = arr.length;
        if (N == 0)
            return;
        int max = arr[0], min = arr[0];
        for (int i = 1; i < N; i++) 
        {
            if (arr[i] > max)
                max = arr[i];
            if (arr[i] < min)
                min = arr[i];
        }
        int range = max - min + 1;
 
        if (range > MAX_RANGE) 
        {
            System.out.println("\nError : Range too large for sort");
            return;
        }
 
        int[] count = new int[range];
        for (int i = 0; i < N; i++)
            count[arr[i] - min]++;
        for (int i = 1; i < range; i++)
            count[i] += count[i - 1];
        int j = 0;
        for (int i = 0; i < range; i++)
            while (j < count[i])
                arr[j++] = i + min;
    }
 
    public static void main(String[] args) 
    {
        System.out.println("Counting Sort Test\n");
        Random random = new Random();
 
        for (int i = 0; i < N; i++)
            sequence[i] = Math.abs(random.nextInt(100));
 
        System.out.println("Elements before sorting");
        for (int i = 0; i < N; i++)
            System.out.print(sequence[i] + " ");
        System.out.println();
 
        sort(sequence);
 
        System.out.println("\nElements after sorting ");
        for (int i = 0; i < N; i++)
            System.out.print(sequence[i] + " ");
        System.out.println();
    }
}

Output:

$ javac Counting_Sort
$ java Counting_Sort
 
Counting Sort
 
Elements before sorting
7 7 41 56 91 65 86 84 70 44 90 38 78 58 34 87 56 16 23 86 
 
Elements after sorting 
7 7 16 23 34 38 41 44 56 56 58 65 70 78 84 86 86 87 90 91

Related posts:

Java Program to Implement Hash Tree
Simplify the DAO with Spring and Java Generics
Java Program to Solve Knapsack Problem Using Dynamic Programming
Java Program to Implement Levenshtein Distance Computing Algorithm
Java Program to Implement Stein GCD Algorithm
Java Program to Implement Hash Tables Chaining with List Heads
Reactive Flow with MongoDB, Kotlin, and Spring WebFlux
The Spring @Controller and @RestController Annotations
Spring Boot - Unit Test Cases
Java Program to Implement the Binary Counting Method to Generate Subsets of a Set
Hướng dẫn Java Design Pattern – Observer
Java Program to Check Whether a Weak Link i.e. Articulation Vertex Exists in a Graph
Tạo ứng dụng Java RESTful Client không sử dụng 3rd party libraries
An Example of Load Balancing with Zuul and Eureka
Guide to Guava Table
Topological Sorting
Java Program to Construct K-D Tree for 2 Dimensional Data
Spring Cloud Connectors and Heroku
Java Program to Represent Graph Using 2D Arrays
Spring MVC Setup with Kotlin
Java Program to Implement Stack API
Java Program to Implement Circular Singly Linked List
Spring Boot With H2 Database
Guide to Spring 5 WebFlux
Giới thiệu Aspect Oriented Programming (AOP)
Hướng dẫn sử dụng Java Annotation
Java Program to Check Whether an Undirected Graph Contains a Eulerian Path
Java Program to Implement Rope
Java Program to Implement the Hill Cypher
Send email with JavaMail
Java Program to Implement Randomized Binary Search Tree
Java Program to Construct an Expression Tree for an Postfix Expression