|
Home Page Statement of Ethics References Notes and Exercises Projects Quizzes Exams Research Papers Important Dates Announcements |
References [1] R.L. Wainwright, A Class of Sorting Algorithms based on Quicksort, Communications of the ACM, Vol. 28, No. 4, April 1985, pgs. 396-402.
[2] R.S. Scowen, Algorithm 271: Quicksort, Communications of the ACM, Vol. 8, No. 11, Nov. 1965, pgs. 669-670.
[3] M.N. vanEmden, Algorithm 402: Increasing the efficiency of Quicksort, Communications of the ACM, Vol. 13, No. 11, Nov. 1970, pgs. 693-694.
[4] C.R. Cook, and Kim D.J, Best sorting algorithm for nearly sorted lists, Communications of the ACM, Vol. 23, No. 11, Nov. 1980, pgs. 620-624.
[5] C.A.R. Hoare, Algorithm 64:Quicksort, Communications of the ACM, Vol. 4, No. 7, July 1961, pg. 321 |
| Spring 2007 |
CSE5311 Design and Analysis of Algorithms |