Suppose that the second pass of an algorithm described in this section does not need all M buffers, because there are fewer than M sublists. How might we save disk I/O s by using the extra buffers? Use Two-Phase, Multiway Merge-Sort Algorithm . Algorithm not mentioned you can choose any algorithm you want.