Run results for: radix sort each base

Run details:

User agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/131.0.0.0 Safari/537.36

Browser: Chrome 131

Operating system: Windows

Device Platform: Desktop

Date tested: one year ago

base 2048 (2^11)

235/s

base 512 (2^9)

208/s

base 1024 (2^10)

196/s

base 4096 (2^12)

184/s

base 256 (2^8)

165/s

base 8192 (2^13)

134/s

base 16

87/s

base 16384 (2^14)

77/s

base 10

71/s

base 32768 (2^15)

64/s

base 8

60/s

base 65536 (2^16)

41/s

base 2

19/s

View exact numbers

Test name	Executions per second
✓ base 2048 (2^11)	235 Ops/sec
base 512 (2^9)	208 Ops/sec
base 1024 (2^10)	196 Ops/sec
base 4096 (2^12)	184 Ops/sec
base 256 (2^8)	165 Ops/sec
base 8192 (2^13)	134 Ops/sec
base 16	87 Ops/sec
base 16384 (2^14)	77 Ops/sec
base 10	71 Ops/sec
base 32768 (2^15)	64 Ops/sec
base 8	60 Ops/sec
base 65536 (2^16)	41 Ops/sec
base 2	19 Ops/sec

Script Preparation code:

function radixSort(arr, base = 10) {
    const logBase = (n, base = Math.E) => Math.log(n) / Math.log(base)
    const getDigit = (num, i) => Math.floor(Math.abs(num) / Math.pow(base, i)) % base
    const digitCount = (num) => num === 0 ? 1 : Math.floor(logBase(Math.abs(num), base)) + 1
    const  mostDigits = (nums) => nums.reduce((ret, val) => Math.max(ret, digitCount(val)), 0)

    const maxDigitCount = mostDigits(arr)

    for (let k = 0; k < maxDigitCount; k++) {
        let digitBuckts = Array.from({
            length: base
        }, () => [])

        for (let i = 0; i < arr.length; i++) {
            digitBuckts[getDigit(arr[i], k)].push(arr[i])
        }

        arr = [].concat(...digitBuckts)
    }

    return arr
}

const arr = Array.from({
    length: 10000
}, () => Math.floor(Math.random() * 10_000_000_000_000))

Tests:

base 2
const x = radixSort(arr, 2)
base 8
const x = radixSort(arr, 8)
base 10
const x = radixSort(arr, 10)
base 16
const x = radixSort(arr, 16)
base 256 (2^8)
const x = radixSort(arr, 256)
base 512 (2^9)
const x = radixSort(arr, 512)
base 1024 (2^10)
const x = radixSort(arr, 1024)
base 2048 (2^11)
const x = radixSort(arr, 2048)
base 4096 (2^12)
const x = radixSort(arr, 4096)
base 8192 (2^13)
const x = radixSort(arr, 8192)
base 16384 (2^14)
const x = radixSort(arr, 16384)
base 32768 (2^15)
const x = radixSort(arr, 32768)
base 65536 (2^16)
const x = radixSort(arr, 65536)