Name: PWL #28: Quicksort and Haskore
Start: 2017-02-02T18:30:00-08:00
End: 2017-02-02T21:30:00-08:00
Location: Comcast Technology Solutions

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.

David Murray

Trevor Lalish-Menagh

Wale Ogundipe

Papers We Love @ Seattle

Technology

Open Source

Intellectual Discussions

Learning

Engineering

Computer Science

Intellectual Curiosity

Education & Technology

New Technology

Research & Development Engineer

Computer Programming

Technology Professionals

Researchers

PWL #28: Quicksort and Haskore

Comcast Technology Solutions

Share

Papers We Love @ Seattle

PWL #28: Quicksort and Haskore

Papers We Love @ Seattle

Details

Members are also interested in