Counting Sort

Counting Sort is an sorting algorithm, which sorts the integers( or Objects) given in a specific range.

Algorithm: Time Complexity O(n)

• Take two arrays, Count[] and Result[] and given array is input[].
• Count[] will store the counts of each integer in the given array.
• Update the Count[] so that each index will store the sum till previous step. (Count[i]=Count[i] + Count[i-1]). Now updated Count[] array will reflect the actual position of each integer in Result[].
• Now navigate the input array taking one element at a time, Count[input[i]] will tell you the index position of input[i] in Result[]. When you do that, decrease the count in Count[input[i]] by 1. See Example

Run This Code

Code:

Output:

Orginal Array [2, 1, 4, 5, 7, 1, 1, 8, 9, 10, 11, 14, 15, 3, 2, 4]
Sorted Array : [0, 1, 1, 1, 2, 2, 3, 4, 4, 5, 7, 8, 9, 10, 11, 14, 15]

Also Read:

- Majority Element – Part 1 Beginner
- Given an array, print all unique subsets with a given sum. Medium
- Dynamic Programming - Highway Billboard Problem Hard
- Sliding Window Algorithm (Track the maximum of each subarray of size k) Hard
- In an array, Duplicate the zeroes without expanding it Beginner
- Count All Paths from Top left to bottom right in Two Dimensional Array including Diagonal Paths Medium
- Snake and Ladder Problem Hard
- Magic Index - Find Index In Sorted Array Such That A[i] = i. Beginner