61
Two-way Merge Sort
(cont)
Requires three in-memory buffers:
Assumption: cost of
Merge
operation on two in-memory buffers
≅ 0
.