Thomas Bellman <bellman at lysator.liu.se> writes: > And I'm fairly certain that 'sort' won't start spending CPU time > until it has collected all its input, so you won't gain much > there either. For large input, sort uses the obvious in-memory sort, external merge algorithm, so it starts using cpu once there's enough input to fill the memory buffer.