AN ANALYSIS OF THE WORST-CASE PERFORMANCE OF QUICKSORT.

C.A.R. Hoare's quicksort algorithm has become a very popular sorting algorithm due to the average performance of θ(n log n), limited use of extra storage (typically θ(logn) recursive calls) and better performance on average compared to heapsort (another θ(n log n) sorting algorithm). It may be found...

Full description

Bibliographic Details

Published in:	InSight: Rivier Academic Journal Vol. 7; no. 1; pp. 1 - 17
Main Author:	Marceau, Robert R.
Format:	Article
Published:	Rivier College (InSight: Rivier Academic Journal) Apr2011
Subjects:	Algorithms Sorting (Electronic computers) C++ C (Computer program language) Java programming language Permutations
Online Access:	View this record in EBSCOhost