Algorithm Magic
summary
A live card trick demonstrates C++ STL algorithms: a 24-card deck initialized with iota, shuffled, a volunteer selects and replaces a card, then the deck splits into four and the procedure repeats three times; accumulate is used to scan each partition (presented as a distributed aggregation), then move and collect rebuild the deck and a find/assert prints the single correct card. The demo compiles the steps into working code and verifies success.
AI-written summary · about
related talks
56mBeginners Guide to C++'s Best Kept Secret -- std::algorithm
46mC++ Fundamentals - Algorithms
01h 21mCPU optimized data structures - more fun with assembler
01h 35mThe Twin Algorithms
04mEuclid's Algorithm & STL
01h 04mBetter Code: Data Structures
05mC++ Algorithms in Haskell and the Haskell Playground
01h 23mAlex Stepanov, Generic Programming in Cpp, and the STL