Computer science you might (not) want to know
summary
Computer science background is useful for concrete things: 0.1 + 0.2 != 0.3 because binary floats truncate, use BigDecimal vs Float or Rational for exact money at the cost of memory and speed, Ruby exposes Ruby's bsearch for O(log n) lookups and git exposes git bisect to find faulty commits by binary search, and Big O gives scaling intuition but real bottlenecks are DB, filesystem, and network so measure with benchmarks.
AI-written summary · about
chapters (10)
- 0:00Start
- 1:16Things to know
- 7:44The float problem
- 12:54Sorting algorithms
- 14:09Comparing algorithms
- 14:57Algorithmic analysis
- 16:32Time/space complexity
- 18:11Linear time (0(n))
- 21:31The binary search algorithm
- 22:29Binary search in the wild: git bisect
related talks
30mComputer Science: The Good Parts
33mFun, Friendly Computer Science
41mI Took Computer Science College “That Way”. Now What?
50mCompSci and My Day Job
26mRuby as Art; Ruby as Science; Ruby as Craft
05m10 Things Junior C++ Devs Don't Get
59mKeynote: Are There any Questions?
27mEvergreen skills for software developers