A presentation at RailsConf 2017 in in Phoenix, AZ, USA by Caleb Hearth
We’ll visualize the steps for several sorting algorithms not only using pretty visualizations on a slide, but also with people as the objects being sorted. Don’t know what an algorithm is, what performance really means, or what “Big O” means, or what these best-, worst-, and average-case time complexities mean? No problem! We’re going to learn together how computers figure out how to sort sets of numbers. You can expect to come out knowing new things and with Benny Hill stuck in your head.
We’ll visualize several sorting algorithms—but we’ll be sorting the audience! Don’t know what an algorithm is, what performance means, what “Big O” is, or the effect best-, worst-, and average-case time complexities? No problem: we’ll learn together! You can expect to come out knowing new things and with Benny Hill stuck in your head.
The following resources were mentioned during the presentation or are useful additional information.
Source code for charts, bars, and playing Benny Hill across several slides.
An illustrated guide for programmers and other curious people
Also available on Netflix
Here’s what was said about this presentation on social media.