Sorting Rubyists
summary
Peeks under Ruby’s sort reveal actual claims and demos not just theory the talk shows live demos with audience numbers and cards to illustrate Bubble Sort, Insertion Sort and Quicksort and counts operations to expose n squared versus n log n behavior it uses Toptal visualizations to compare random nearly sorted reversed and few unique inputs and states Ruby uses Quicksort in its sort implementation the presenter also mentions Heroku automated certificate management and Let's Encrypt for paid dynos
AI-written summary · about
chapters (7)
- 0:00Start
- 1:40Algorithms
- 3:19Algorithms for Cutting Out Squares from Paper
- 9:26When Do You Update a User Record on Login
- 12:31The Bubble Sort Algorithm
- 17:11Insertion Sort
- 30:33Office Hours
