The Input/ Output Complexity of Sorting and Related Problems.
Saved in:
| Title: | The Input/ Output Complexity of Sorting and Related Problems. |
|---|---|
| Authors: | Aggarwal, Alok, Vitter, Jeffrey Scott |
| Source: | Communications of the ACM. Sep88, Vol. 31 Issue 9, p1116-1127. 12p. 2 Diagrams. |
| Subjects: | Dynamic storage allocation (Computer science), Sorting (Electronic computers), Algorithms, Mathematical optimization |
| Abstract: | Provides tight upper and lower bounds, up to a constant factor, for the number of inputs and outputs between internal memory and secondary storage required for sorting-related problems. Secondary storage modeled as a magnetic disk; Optimal algorithms for the problems; Sorting algorithms using the same number of inputs and outputs. |
| Database: | Engineering Source |
Be the first to leave a comment!
