TheUNIXSystem: Theory and Practice in the Construction of a Working Sort Routine
- 1 October 1984
- journal article
- website
- Published by Institute of Electrical and Electronics Engineers (IEEE) in AT&T Bell Laboratories Technical Journal
- Vol. 63 (8), 1827-1843
- https://doi.org/10.1002/j.1538-7305.1984.tb00067.x
Abstract
Because comparison in the standard UNIX™ operating system sort routine, /bin/sort, is interpretive, it is generally more time-consuming than the standard paradigm of comparing two integers. When a colleague and I modified sort to improve reliability and efficiency, we found that techniques that improved performance for other sorting applications sometimes degraded the performance of sort. Input and output are important when comparisons are simple, but as comparisons become more complex, the number of comparisons quickly dominates the performance of sort.Keywords
This publication has 4 references indexed in Scilit:
- Implementing Quicksort programsCommunications of the ACM, 1978
- Algorithm 347: an efficient algorithm for sorting with minimal storage [M1]Communications of the ACM, 1969
- QuicksortThe Computer Journal, 1962
- Algorithm 64: QuicksortCommunications of the ACM, 1961