Ruby as Science, Art & Craft
summary
Compares concrete convex hull algorithms: a brute‑force O(n^3) check of every pair and point, Jarvis March gift‑wrapping at O(n·h) (worst‑case O(n^2)), and Graham scan at O(n log n), and argues choose the simplest algorithm that meets expected data sizes and maintenance cost. Reports an experiment collecting examples of “beautiful” Ruby: a one‑file Flappy‑Bird clone, concise gems (oauth2 influences many libraries), and playful DSLs; claims beauty can be API clarity, performance wins, or just joyful, working code.
AI-written summary · about
chapters (7)
- 0:00Introduction and background
- 1:56Computer science fundamentals
- 6:13Analyzing convex hull algorithms
- 12:13The art and beauty of code
- 16:41Craftsmanship and mastery
- 21:11Defining beautiful code
- 24:40Conclusion and community
