forked from akshitagit/JavaScript
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathCountSort.js
More file actions
39 lines (30 loc) · 806 Bytes
/
CountSort.js
File metadata and controls
39 lines (30 loc) · 806 Bytes
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
38
39
// Count sort counts the frequencies of elements and
// creates a new array inserting elements by their frequencies.
// Suitable for a sorting arrays within short range
// Time complexity: O(n)
// Space required: O(n+m)
export default CountSort = (arr)=>{
const n = arr.length;
let maxElement = 0;
for(let i=0; i<n; i++){
if(arr[i]>maxElement){
maxElement=arr[i];
}
}
let counts = new Array(maxElement+1);
for(let i=0; i<=maxElement; i++){
counts[i]=0;
}
for(let i=0; i<n; i++){
counts[arr[i]]++;
}
let newArray = new Array(n);
let c=0;
for(let i=0; i<=maxElement; i++){
while(counts[i]>0){
newArray[c++] = i;
counts[i]--;
}
}
return newArray;
}