|
[1] J. L. Bentley, Programming Pearls, Addison-Wesley, 1986. [2] D.Cantone and G. Cincotti, Quickheapsort, an efficient mix of classical sorting algorithms, CIAC, LNCS 1767, (2000), 150-162. [3] R. D. Dutton, The weak-heap data structure, Technical report, University of Central Florida, Orlando, FL 32816, (1992). [4] R.D. Dutton, Weak-heap sort, BIT, 33 (1993), 372-381. [5] R.W. Floyd, Treesort 3(alg.245), Communications.of ACM, 7 (1964), 701. [6] C.A.R. Hoare, Quicksort, Computing Journal, 5 (1962), 10-15. [7] C.A.R Hoare, Algorithm 63(partition) and algorithm 65(find), Communications.of ACM, 4:7 (1961), 321-322. [8] D. E. Knuth, The Art of Computer Programming, volume 3: Sorting and Searching, Addison-Wesley, Reading MA, 1975. [9] M. D. McIlroy, A killer adversary for quicksort, Software-Practice and Experience, 29:4 (1999), 341-344. [10] R. L. Rivest and D.E. Knuth, Bibliography 26: computer sorting, Computer Reviews, 13 (1972), 283-289. [11] R.Sedgewick,Quicksort, PhD Thesis, Stanford University, 1975. [12] R.Sedgewick, The analysis of quicksort programs, Acta Informatica, 7 (1977), 327-355. [13] R. Sedgwick, Algorithms in C, Addison-Wesley, 1990. [14] R. Sedgewick, Implementing quicksort programs, Communications Of ACM , 21:10 (1978), 847-857. [15] R. Sedgewick, Quicksort, Garland Publishing, New York, 1980. [16] J.W. Williams, Heapsort (alg.232), Communications of ACM, 7(1964), 347-348. [17] I. Wegener, Bottom-Up-Heapsort, a new variant of Heapsort, beating, on an average, Quicksort (if n is not very small), Theoretical Computer Science, 118 (1993), 81-98.
|