Today I Learned

2026-07-10
Lecture Friday: Sorting Algorithms: Speed Is Found In The Minds of People

I've gone on record before to say, stop teaching sorting algorithms. They're not interesting. Teaching early Computer Science students sorting algorithms is a form of ritualistic hazing at this point. Teach them convex hulls instead. Full of graphics and tons of obvious practical applications to the beginner or interdisciplinary studier. However, this is a great talk. So watch it anyway.

The big reason is that this is what real performance looks like. This isn't some theoretical big-O notation view of the world. This is how real computers work and how they really don't align with that simple model everyone was taught.

$\left(\mathrm{<abbr\; title="comparisons">C</abbr>}\right(n\left)\mathrm{<abbr\; title="moves/swaps">M</abbr>}\right(n\left)k\mathrm{<abbr\; title="average\; distance\; between\; two\; subsequent\; array\; accesses">D</abbr>}\right(n\left)\right)n$

2026-07-03
Lecture Friday: Secret History of Silicon Valley

It always pays to learn your history. Lots of potential lessons.