A new sort algorithm: Self-indexed sort

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 31, Issue 3, 1996, Pages 28-36

  Wang, Sunny Y ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Algorithm; Computing; Performance analysis; Software; Sort

Indexed keywords

EID: 0005894370     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/227717.227725     Document Type: Article

References (14)

1. D.E. Kunth, The Art of Computer Programming: Vol. 3, Sorting and Searching, 2nd printing, Addison-Wesley, Reading, MA, 1975.
2. R. Sedgewick, Algorithms, 2nd ed., Addison-Wesley Series in Computer Science, pp. 111-113, 1988.
3. C.A.R. Hoare, "Algorithm 64: Quicksort," Communications of the ACM, Vol. 4 , pp. 321, 1961.
4. C.A.R. Hoare, "Quicksort," BCS Computer Journal, Vol. 5, No. 1, pp. 10-15, 1962.
5. C.A.R. Hoare, Essays in Computer Science, Prentice-Hall, 1992.
6. R. Sedgewick. Stanford University Ph.D. Dissertation, 1975.
7. R. Sedgewick, "Implementing Quicksort Programs," Communications of the ACM, Vol.21, No. 10, pp. 847-856, 1978.
8. R. Sedgewick. Quicksort, Garland, New York, 1980.
9. B.C. Huang and D.E. Kunth, "A one-way, stackless quicksort algorithm," BIT 26, pp. 127-130, 1986.
10. J.P. Linderman, "Theory and Practice in the Construction of a Working Sort Routine," Bell System Technical Journal 63, pp.1827-1843, 1984.
11. D.F. Stubbs and N.W. Webre, Data Structures with Abstract Data Type and Ada, PWS-KENT Publishing Company, pp.301-341, 1993.
12. S. Baase, Computer Algorithms: Introduction to Design and Analysis, Addison-Wesley Publishing Co., pp. 58-132, 1978.
13. J. W.J. Williams, "Algorithm 232: Heapsort," Communication of the ACM, No.7, pp.347-348, 1964.
14. Yingxu Wang, On the Design of Self-Indexed Sorting Algorithm, Research Report 95-06-02, Oxford University Computing Laboratory, 1995.