Episode 126: Flux (and Flow) with Tristan Brindle
Algorithms + Data Structures = Programs
00:00
The Importance of Internal Iteration
This episode's not out, but the, the one unreleased episode is basically bright. It tackles this problem of an internal iteration. You can do internal iteration in a way that is more efficient than just stepping through and doing increment dereference. And there are a huge number of algorithms that can be written in terms of internal iteration. I have this idea for a talk that I might flesh out at some point: What is the most powerful algorithm in the STL? My conjecture is that it's standard find if.
Transcript
Play full episode
