1//Radix Sort is a linear sorting algorithm that sorts elements by processing them digit by digit.
2// It is an efficient sorting algorithm for integers or strings with fixed-size keys. 
3let arr = [121,432, 564, 23, 1, 45, 788]
4
5function getDigit(num, place) {
6    return Math.floor(Math.abs(num) / Math.pow(10, place)) % 10;
7}
8
9function digitCount(num) {
10    if (num === 0) return 1;
11    return Math.floor(Math.log10(Math.abs(num))) + 1;
12}
13
14function mostDigits(nums) {
15    let maxDigits = 0;
16    for (let i = 0; i < nums.length; i++) {
17        maxDigits = Math.max(maxDigits, digitCount(nums[i]));
18    }
19    return maxDigits;
20}
21
22function radixSort(arr) {
23    let maxDigitCount = mostDigits(arr);
24    for (let k = 0; k < maxDigitCount; k++) {
25        let digitBuckets = Array.from({length: 10}, () => []);
26        for (let i = 0; i < arr.length; i++) {
27            let digit = getDigit(arr[i], k);
28            digitBuckets[digit].push(arr[i]);
29        }
30        arr = [].concat(...digitBuckets);
31    }
32    return arr;
33}
34
35console.log(radixSort(arr));