Internal sort modules based on two-way merge algorithms

✍ Scribed by Carlos F. Bunge; Gerardo Cisneros

Book ID: 103505576
Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 574 KB
Volume: 10
Category: Article
ISSN: 0097-8485
DOI: 10.1016/0097-8485(86)80003-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Perfectly overlapped merging and sorting

Perfectly overlapped merging and sorting on a two-way linear array

✍ Yen-Chun Lin 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 475 KB

We present a perfectly overlapped merging algorithm, which can require almost only input time to perform merge sorting on a linear array of processors. The optimal merge order that minimizes the merge sorting time is obtained in constant time. The merging algorithm and a previously proposed runs-gen