Quicksort, or partition-exchange sort, is a sorting algorithm developed by Tony Hoare that, on average, makes O(n log n) comparisons to sort n items. In the worst case, it makes O(n2) comparisons, though this behavior is rare. Quicksort is often faster in practice than other O(n log n) algorithms. Additionally, quicksort`s sequential and localize....
Found on
http://en.wikipedia.org/wiki/Quicksort
algorithmsplit the data into two roughly equal parts with all the lesser elements in one and the greater ones in the other and then sort each part. -- Prof. C. A. R. Hoare wrote this a young programmer and team leader. His future career started with the publication of this elegant recursion for placing an array of numbers into order.
Found on
http://www.csci.csusb.edu/dick/cs202/glossary.html
No exact match found.
