An adaptive method for unknown distributions in distributive partitioned sorting

IEEE Transactions on Computers

Volumn C-34, Issue 4, 1985, Pages 367-372

  Janus, Philip J ^a   Lamagna, Edmund A ^b  

^a HEWLETT PACKARD COMPANY   (United States)

^b Department ot Computer Science and Statistics UJniversity of Rhode Island ^*  (United States)

Author keywords

cumulative distribution function; distributive partitioning; Index Terms Analysis of algorithms; Quicksort; sorting

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS;

DISTRIBUTIVE PARTITIONED SORTING;

COMPUTER SYSTEMS PROGRAMMING;

EID: 0022044133     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.1985.5009388     Document Type: Article

References (13)

1. W. Dobosiewicz, “Sorting by distributive partitioning”, Inform. Processing Len., vol, 7, pp. 1–6, 1978.
2. C. A. R. Hoare “Quicksort” Comput. J., vol.5,no. 1, Commun. 10–15, 1962.
3. R Sedgewick, “Implementing Quicksort programs”,Commun. pp 10-15,1962 ACM, vol. 21,, no. l0, pp. 847–856, 1978.
4. D. B. Knuth, The Art of Computer Program9ing, Vol. 3: Sorting and Searching. Reading, MA: Addison-Wesley, 1973.
5. M. Blum, R. E. Floyd, V. Pratt, R. L. Rivest, and R. E. Tarjan, “Tirne bounds for selection”, J. Comput. Syst. Sci., vol. 7, no. 4, pp. 448–461, 1973.
6. R. W. Floyd and R. L. Rivest, “Expected time bounds for selection” and “Algorithm 489: SELECT”, Commun. ACM, vol. 18, no. 3, pp. 165–173, 173, 1975.
7. A. Schonhage, M. Paterson, and N. Pippenger, “Finding the median”,]J. Comput. Syst. Sci., vol. 13, no. 2, pp. 184–199, 1976.
8. P. J. Janus, “Adaptive methods for unknown distributions in distributive partitioning sorting”, M.S. thesis, Univ. Rhode Island, Kingston, P'I, 1981.
9. H. Meijer and S. G. Akl, “The design and analysis of a new hybrid sorting algorithm”, Inform. Processing Lett., vol. 10, no. 4, 5, pp. 213–218, 218, 1980.
10. B. W. Weide, “Statistical methods in algorithm design and analysis)”, Ph.D. dissertation, Carnegie-Mellon Univ., Pittsburgh, PA, 1978.
11. E. E. Lindstrom and J. S. Vitter, “The design and analysis of BucketSort for bubble memory secondary storage”, IEEE Trans. Comput., vol. C-34, pp. 218–233, Mar. 1985.
12. W. Dobosiewicz, “The practical significance of DP sort revisited” Inform. Processing Lett., vol. 8, no. 4, pp. 170–172, 1979.
13. W. Dobosiewicz “IBM System/370 Model 158 functional characteristics”, in IBM Systems Manual GA22-701]-5, Appendix B, 1978.