Radix Sort Algoritması

1function radixSort(arr) {
2  const result = [...arr];
3  if (result.length === 0) return result;
4  
5  const max = Math.max(...result);
6  
7  for (let exp = 1; Math.floor(max / exp) > 0; exp *= 10) {
8    countingSortByDigit(result, exp);
9  }
10  
11  return result;
12}
13
14function countingSortByDigit(arr, exp) {
15  const n = arr.length;
16  const output = new Array(n).fill(0);
17  const count = new Array(10).fill(0);
18  
19  for (let i = 0; i < n; i++) {
20    const digit = Math.floor(arr[i] / exp) % 10;
21    count[digit]++;
22  }
23  
24  for (let i = 1; i < 10; i++) {
25    count[i] += count[i - 1];
26  }
27  
28  for (let i = n - 1; i >= 0; i--) {
29    const digit = Math.floor(arr[i] / exp) % 10;
30    output[count[digit] - 1] = arr[i];
31    count[digit]--;
32  }
33  
34  for (let i = 0; i < n; i++) {
35    arr[i] = output[i];
36  }
37}