forked from TheAlgorithms/JavaScript
-
Notifications
You must be signed in to change notification settings - Fork 0
/
CountingSort.js
37 lines (35 loc) · 1.05 KB
/
CountingSort.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
/**
* Counting sort is an algorithm for sorting a collection
* of objects according to keys that are small integers.
*
* It is an integer sorting algorithm.
*
* Wikipedia: https://en.wikipedia.org/wiki/Counting_sort
* Animated Visual: https://www.cs.usfca.edu/~galles/visualization/CountingSort.html
*/
export const countingSort = (arr, min, max) => {
// Create an auxiliary resultant array
const res = []
// Create and initialize the frequency[count] array
const count = new Array(max - min + 1).fill(0)
// Populate the freq array
for (let i = 0; i < arr.length; i++) {
count[arr[i] - min]++
}
// Create a prefix sum array out of the frequency[count] array
count[0] -= 1
for (let i = 1; i < count.length; i++) {
count[i] += count[i - 1]
}
// Populate the result array using the prefix sum array
for (let i = arr.length - 1; i >= 0; i--) {
res[count[arr[i] - min]] = arr[i]
count[arr[i] - min]--
}
return res
}
/**
* Implementation of Counting Sort
*/
// const array = [3, 0, 2, 5, 4, 1]
// countingSort(array, 0, 5)