PWL #28: Quicksort and Haskore

We will have Wale Ogundipe presenting on Quicksort (paper link (http://comjnl.oxfordjournals.org/content/5/1/10.full.pdf)), and Chris Kolodin presenting on Haskore (paper link (http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.36.8687&rep=rep1&type=pdf)).

Quicksort is one of the most important and ubiquitous algorithms of Computer Science. If you use Google Chrome, you use it. In this short presentation, Walé will summarize the paper and tease out some of its finer points. Please feel free to read the paper ahead of time - it weighs in as 6 pages, so it should be a relatively quick (gah, no pun intended) read.