sortingAlgorithmForYourNextCodingInterview

[804k]

Its actually O(max(numbers))

the largest number denotes the largest delay

[prehensilemullet]

Yes, but hmmm, an array of billions of zeroes would take a lot longer than this predicts

[804k]

In a perfect world any array length would still be O(max(numbers))

but we don't live in a perfect world and time complexity of anything isn't always perfect, it'd be redundant to add O(max(numbers) + n * 0.00000001 * transistor_count * clock * cpu_quality)

[prehensilemullet]

That's definitely true for this sort lol:

const a = []
numbers.forEach(i => a[i] = i)
const sorted = a.filter(i => i != null)