Ruby as Art; Ruby as Science; Ruby as Craft
summary
States there is zero code and uses math to compare convex hull algorithms including O(n^3) brute force versus Gift Wrapping (Jarvis March) at O(nh) and faster Graham scan at O(n log n), notes at least eight O(n log h) variants discovered recently. Demonstrates real uses in graphics and GIS, shows when sorting or indexing yields O(log n) searches, and recommends isolating replaceable algorithm components for measurable performance gains.
AI-written summary · about
chapters (5)
- 0:00Start
- 2:12Analysis and Study of Algorithms
- 4:38Danger Zone Exponential
- 6:58Brute Force Approach
- 8:27Gift Wrapping Algorithm
