9
Two-way Merge Sort
(cont)
Requires three in-memory buffers:
Assumption: cost of merge on two buffers
≅ 0
.
![[Diagram:Pics/scansortproj/two-way-buf.png]](Pics/scansortproj/two-way-buf.png)
![[prev]](icon/prev.gif){kind=icon}
![[next]](icon/next.gif){kind=icon}