PRODUCT FOR TUPLES Sketch of a recursive algorithm: Sketch of a recursive algorithm: 90CARTESIAN PRODUCT FOR TUPLES CARTESIAN PRODUCT FOR TUPLES Sketch of a recursive algorithm: Sketch of a recursive algorithm: into �rst and rest 90.1CARTESIAN PRODUCT FOR TUPLES CARTESIAN PRODUCT FOR TUPLES Sketch of a recursive algorithm: Sketch of a recursive algorithm: 1. Split the given tuples into �rst and rest 2. Let C product of the rest 90.2CARTESIAN PRODUCT FOR TUPLES CARTESIAN PRODUCT FOR TUPLES Sketch of a recursive algorithm: Sketch of a recursive algorithm: 1. Split the given tuples into �rst and rest 2. Let C

functions, but we will use the cleaner auto parameter syntax for our helper functions 9 . 3/ Library sketch // library constexpr auto every_second_item(auto lambda) { constexpr auto data = lambda();

(Careful!) 120Bug Mitigate with a Wrapper Class ● We can build our own pointer class ○ (Example sketch to the right) ○ The idea is to build abstraction around a ‘raw/naked/plain pointer’ ● Luckily