Counting Sort Algorithm - The Coding Shala

Last Updated: 20-Jan-2021
Home >> Algorithms >> Counting Sort

 In this post, we will learn what is Counting Sort Algorithm and how it works. We will write a Java program for Counting Sort.

Counting Sort Algorithm

Counting Sort Algorithm is an algorithm used to sort a given array. We use counting sort if given array elements are in a specific range. It works by counting the number of objects having distinct key values and using those counts we compute an item's index in the final sorted array.

Working of Counting Sort Algorithm

The following steps we follow for the counting sort algorithm:
  • Step 1. We will iterate through the input once and count the number of times each item occurs.
  • Step 2. Now we modify our count array to pre-compute where each item from the input should go. This step is a little be tricky. We add the previous sum to the current element in the count array. To get more understanding see the below example.
  • Step 3. Now we will use our pre-computed count array to put all the elements at the given sum index in the count array and then decrease the value in the count array by 1.
Here is an example of a counting sort algorithm:

We have an array  -> {4,8,4,2,9,9,6,2,9}
In the above-given array, the range of numbers is 0 to 10(inclusive).

The idea is to count how many 0's we see in an array, how many 1's, and so on. There are 11 possible values in the range of 0 to 10, we will use an array with 11 counters initialized to 0.

counts array:
                  0   0   0   0   0    0   0   0    0   0   0 
  |     |    |    |     |     |    |    |     |    |    |
  0   1   2   3   4    5   6   7    8   9  10

Now we iterate the input array once and store the count at index.

INPUT->  4 8 4 2 9 9 6 2 9

The first item 4 comes we add one to counts[4] and like this for the rest of the others.
Final Count array:
                          0   0    2   0   2    0   1   0   1   3   0
  |     |     |    |    |     |     |    |    |    |     |
         0    1    2   3   4    5   6   7   8   9  10

Now we will build the index array means will modify the counts array so can decide where each item from the input should go.

We modify the counts' array such that each element at each index stores the sum of previous counts.

     Counts array ->                     0 0 2 0 2 0 1 0 1 3 0 
  Counts array after modify ->   0 0 2 2 4 4 5 5 6 9 9

Now for the final step, we insert items in the output array by taking index from the counts' array.

   Input Array->     4 8 4 2 9 9 6 2 9
   Counts array->   0 0 2 2 4 4 5 5 6 9 9 

Output array: the first item is 4 so look the index 4 in the counts' array is 4 so we will insert the 4 in the output array at 4-1(3) index.

Output array->  0 0 0 4 0 0 0 0 0

And will decrease the counts[4] by 1.   counts-> 0 0 2 2 3 4 5 5 6 9 9

The next element is 8 will go counts[8] = 9 so will add 8 at 9-1=8 index in output and so on.

Final output array is -> 2 2 4 4 6 8 9 9 9 

The time complexity of Counting sort

Counting sort algorithm takes O(n+k) time in average, best, and worst case. The counting sort algorithm takes O(n+k) Space, where n is the length of the given array and k is the range of numbers.

So we can say counting sort takes O(n) time and space. So why don't we use it everywhere? The reason is Counting sort only works when the range of items in the input is known ahead of time. And the range of values is big then for counting sort requires a lot of space.

Counting Sort Algorithm Java Program

Java Program: 

//counting sort
//the coding shala

class Main{
	
	public static void counting_sort(int[] input) {
		int len = input.length;
		//range is 0 to 10(inclusive)
		int[] output = new int[len];
		int[] counts = new int[11];
		
		//step 1 count the numbers of element
		for(int i=0;i<len;i++) {
			counts[input[i]]++;
		}
		
		//modify the count array to get index to sort the array
		for(int i=1; i<counts.length; i++) {
			counts[i] += counts[i-1];
		}
		
		//now take the index from counts array 
		//insert at index in output array
		//decrease the value by 1 in counts array
		for(int i=0; i<len; i++) {
			int ele = input[i];
			int index = counts[ele];
			output[index-1] = ele;
			counts[ele]--;
		}
		
		//insert back to original array
		for(int i=0; i<len;i++) {
			input[i] = output[i];
		}
	}
	
	public static void main(String[] args) {
		int[] input = {4,8,4,2,9,9,6,2,9};
		int len = input.length;
		counting_sort(input);
		for(int i=0;i<len;i++) {
			System.out.print(input[i]+" ");
		}
	}
}


Other Posts You May Like
Please leave a comment below if you like this post or found some errors, it will help me to improve my content.
By

Comments

Post a Comment

Popular Posts from this Blog

Java Program to Convert Binary to Decimal - The Coding Shala

Home >> Java Programs >> Convert Binary to Decimal  Hey there, welcome back to another post. In this post, we will learn how to convert Binary to Decimal in Java. Java Program to Convert Binary to Decimal You have given a binary number, convert it to a decimal number. Example:  Input: 101 Output: 5 Input: 111 Output: 7 Binary to Decimal Conversion in Java Approach We will the below formula to convert binary to decimal: decimal number = (2^0) * (rightmost digit) + (2^1) * (second rightmost digit) + ...  for example:  binary number = 110 decimal number = 2^0 * 0 + 2^1 * 1 + 2^2 * 1 = 1 * 0 + 2 * 1 + 4 * 1 = 0 + 2 + 4 = 6 Java Program:  import java.util.Scanner; /** * https://www.thecodingshala.com/ */ public class Main { public static void printDecimal( int num) { int decimal = 0; int twos = 1; // 2^0 = 1 initial value while (num > 0) { ...
Read more

N-th Tribonacci Number Solution - The Coding Shala

Home >> Programming >> N-th Tribonacci Number  Hey there, welcome back to another post. In this post, we will learn how to solve the N-th Tribonacci Number problem and will implement its solution in Java. N-th Tribonacci Number Problem Statement The Tribonacci sequence Tn is defined as follows: T0 = 0, T1 = 1, T2 = 1, and Tn+3 = Tn + Tn+1 + Tn+2 for n >= 0. Given n, return the value of Tn.  Example 1:  Input: n = 4 Output: 4 Explanation: T_3 = 0 + 1 + 1 = 2 T_4 = 1 + 1 + 2 = 4 N-th Tribonacci Number Java Solution using Bottom-Up DP This problem is similar to the Fibonacci series. We can solve it using the Bottom-Up approach of dynamic programming. Time Complexity: O(n) Space Complexity: O(n) The space complexity can be reduced to O(1) by using variables to store the previous three values instead of using an array. Java Program:  class Solution { public int tribonacci( int n) { if (n == 0) return 0; ...
Read more

LeetCode - Swap Nodes in Pairs Solution - The Coding Shala

Home >> LeetCode >> Swap Nodes in Pairs LeetCode - Swap Nodes in Pairs Solution In this post, you will learn how to solve LeetCode's Swap Nodes in Pairs problem with Java Solution. We will solve this problem using recursion and iteration. Given a linked list, swap every two adjacent nodes and return its head.  You may not modify the values in the list's nodes, only nodes itself may be changed. Example: Given 1->2->3->4, you should return the list as 2->1->4->3. Practice this problem on  LeetCode(Click Here). Swap Nodes in Pairs Java Solution Approach 1: Iterative Solution. Java Program:  /** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */ class Solution { public ListNode swapPairs ( ListNode head ) { //check for null or 1 node if ( head == null || head . next == n...
Read more

Introduction to Kotlin Programming Language for Backend Development - The Coding Shala

Home >> Learn Kotlin >> Kotlin Introduction Are you looking for a powerful and reliable programming language for backend development? Look no further than Kotlin. Kotlin is a modern, statically typed programming language that has gained a lot of popularity in recent years. In this blog post, we'll take a look at what Kotlin is and why it's a great choice for backend development. What is Kotlin? Kotlin is a statically typed, cross-platform, general-purpose programming language that was developed by JetBrains in 2011. It is designed to be more concise, expressive, and safe than Java, the most widely used programming language for Android development. Kotlin can be compiled to run on the Java Virtual Machine (JVM), JavaScript, and native platforms, making it a versatile language for different types of applications. Why use Kotlin for backend development? Kotlin has several features that make it a suitable language for backend development, such as: Concisenes...
Read more

LeetCode - Crawler Log Folder Solution - The Coding Shala

Home >> LeetCode >> Crawler Log Folder  In this post, we will learn how to solve LeetCode's Crawler Log Folder problem and will implement Crawler Log Folder Java Solution. Crawler Log Folder Problem The Leetcode file system keeps a log each time some user performs a change folder operation. The operations are described below: "../": Move to the parent folder of the current folder. (If you are already in the main folder, remain in the same folder). "./": Remain in the same folder. "x/": Move to the child folder named x (This folder is guaranteed to always exist). You are given a list of strings logs where logs[i] is the operation performed by the user at the ith step. The file system starts in the main folder, then the operations in logs are performed. Return the minimum number of operations needed to go back to the main folder after the change folder operations. Input: logs = ["d1/","d2/","../","d2...
Read more