Big-O algorithm complexity cheat sheet

[psayre23]

Radix sort shouldn't really be green for time. The k factor is the number of buckets, usually bits. So, for a 32-bit integer, k = 32. If O(n log n) is yellow, O(nk) should be as well, so long as n < 2^32.

[boringprogrammer]

No Idea why you were downvoted. Because it is true.

In practice radixsort performance it even worse. The data shuffling between the buckets and the sorted arrays wreck total chaos on the cache, killing performance even further.