3 ms·
Unless your thread scheduler can fairly choose from linearly many threads in constant time with 0 cost context switching and your threads take 0 time to call sl
by kd0amg 12y ago
Unless your thread scheduler can fairly choose from linearly many threads in constant time with 0 cost context switching and your threads take 0 time to call sleep(), at large input sizes, you eventually have to make the base sleep time longer, so it's not really linear time complexity.
- dspillett 12y agoMainly for the purposes of making my earlier statement correct, I consider that to be an implementation specific problem which we do not need to consider in theoretical discussions!