login/register

Snip!t from collection of Alan Dix

see all channels for Alan Dix

Snip
summary

A versatile variant of Heapsort, adapted for external di... presented. On a single processor RAM with internal memor... Θ(m + kbw) words, it sorts a file of n records of ... stored in m physical blocks, each consisting of b record... using O(m l

An Optimal in-Situ Disk Sorting Algorithm Based on Heapsort (ResearchIndex)
http://citeseer.ist.psu.edu/wiedermann97optimal.html

Categories

/Channels/AVL trees

[ go to category ]

For Snip

loading snip actions ...

For Page

loading url actions ...
A versatile variant of Heapsort, adapted for external disk sorting, is presented. On a single processor RAM with internal memory capacity Θ(m + kbw) words, it sorts a file of n records of length w words, stored in m physical blocks, each consisting of b records, on a disk, using O(m log m/ log k) input/output operations, and O(n log n) internal key comparisons, for any k ≥ 2. For internal memory of capacity s words, with s = Θ(m) = Θ(kbw), the previous estimate is...

HTML

A versatile variant of Heapsort, adapted for external disk sorting, is presented. On a single processor RAM with internal memory capacity Θ(m + kbw) words, it sorts a file of n records of length w words, stored in m physical blocks, each consisting of b records, on a disk, using O(m log m/ log k) input/output operations, and O(n log n) internal key comparisons, for any k ≥ 2. For internal memory of capacity s words, with s = Θ(m) = Θ(kbw), the previous estimate is...

Search Alan Dix Snips

Channels - Alan Dix