Title
A note on slowing Quicksort
Document Type
Article
Publication Date
1993
Department/School
Computer Science
Abstract
We present a simple linear time algorithm for generating a worst case sequence for Quicksort when the pivot element is chosen as the middle elements of the (sub)array in each pass.
Link to Published Version
Recommended Citation
Chaudhuri, R., & Dempster, A. C. (1993). A note on slowing Quicksort. ACM SIGCSE Bulletin, 25(2), 57–58. doi:10.1145/152751.152764
