This outline is also available in PDF.
Held: Friday, 17 November 2006
Summary: Today we consider our final sorting algorithm, Quicksort. Quicksort is a divide-and-conquer algorithm that also relies on chance.
large? Guess the dividing point by selecting a random element.
I usually create these pages
on the fly, which means that I rarely
proofread them and they may contain bad grammar and incorrect details.
It also means that I tend to update them regularly (see the history for
more details). Feel free to contact me with any suggestions for changes.
This document was generated by
Siteweaver on Thu Nov 30 21:43:35 2006.
The source to the document was last modified on Mon Sep 4 08:43:35 2006.
This document may be found at
You may wish to validate this document's HTML ; ;Samuel A. Rebelsky, firstname.lastname@example.org
http://creativecommons.org/licenses/by-nc/2.5/or send a letter to Creative Commons, 543 Howard Street, 5th Floor, San Francisco, California, 94105, USA.