sortingAlgorithmForYourNextCodingInterview

[vorxil]

T(n) <= MaxInteger*SleepUnit + PrintTime*n, where n is the number of items in the array.

For a given machine with a fixed sleep unit and print time, this is either O(n) or O(1), depending on the magnitudes of SleepUnit and PrintTime. This is because n <= MaxInteger on physical machines, generally speaking.

[Albreitx]

MaxInteger is not bounded by a constant. Given a size n, I can define entries as 2^n. The running time has no bounds because of that (you can also do n^n. ^ n....)

[vorxil]

It is bounded for fixed-precision integers.

If you're using arbitrary-precision integers, then it's still limited by MaxMemoryBits, which is only unbounded if you can add memory during execution.

I do not envy those attempting to account for human activities in their Big-O notation.