counting Sort Algorithm
Bucket sort may be used for many of the same tasks as counting sort, with a like time analysis; however, compared to counting sort, bucket sort necessitates associated lists, dynamic arrays or a large amount of preallocated memory to keep the sets of items within each bucket, whereas counting sort instead stores a individual number (the count of items) per bucket.
Because counting sort uses key values as indexes into an array, it is not a comparison sort, and the Ω(n log N) Although radix sorting itself dates back far longer,
counting sort, and its application to radix sorting, were both invented by Harold H. Seward in 1954.
/*
* 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.
* more information: https://en.wikipedia.org/wiki/Counting_sort
* counting sort visualization: https://www.cs.usfca.edu/~galles/visualization/CountingSort.html
*/
function countingSort (arr, min, max) {
let i
let z = 0
const count = []
for (i = min; i <= max; i++) {
count[i] = 0
}
for (i = 0; i < arr.length; i++) {
count[arr[i]]++
}
for (i = min; i <= max; i++) {
while (count[i]-- > 0) {
arr[z++] = i
}
}
return arr
}
const arr = [3, 0, 2, 5, 4, 1]
// Array before Sort
console.log('-----before sorting-----')
console.log(arr)
// Array after sort
console.log('-----after sorting-----')
console.log(countingSort(arr, 0, 5))
