| |
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
First, use sort -m, as both inputs are already sorted. This both
changes from it from O(n*log(n)) to O(n), and allows sort(1) to produce
streaming output, instead of sponging all the input, and potentially
spilling to disk during the process.
Second, use awk(1) when looping. Not only awk(1) is made for this type
of job, but also we only call it once and let it do the loop, over
looping manually and calling '['(1), printf() and cut(1) on each
iteration. Now we call cut(1) only once.
It went from being annoying enough to make me pause considering using to
being unnoticeable.
|
