🎥
- V.Ciura. Regular types and why do I care? – ACCU (2019)
- V.Ciura. Regular types and why do I care? – CppCon (2018)
- A.Stepanov. STL and its design principles (2002)
🔗
- A.Shavit. Affine space types (2018)
🎥
- A.Shavit, B.Fahller. The curiously recurring pattern of coupled types – NDC (2019)
- A.Shavit, B.Fahller: The Curiously Recurring Pattern of Coupled Types – StockholmCpp (2018)
🎥
- B.Deane. Constructing generic algorithms: Principles and practice – CppCon (2020)
📖
- A.A.Stepanov, D.E.Rose. From mathematics to generic programming (2014)
🔗
- S.Ignatchenko. Some big-Os are bigger than others – Overload 134 (2016)
- R.Orr. Order notation in practice – Overload 124 (2014)
🔗
- Amortized analysis – Cornell University CS 3110: Data structures and functional programming (2012)
- Amortized complexity in layman’s terms? – Stack Overflow
- Difference between average case and amortized analysis – Stack Overflow
A loop invariant is a property of a program loop that is true before and after each iteration.
🔗
- Loop invariant – Wikipedia
📖
- Col. 4: Writing correct programs – J.Bentley. Programming pearls (1999)
📄
- J.Bentley. Programming pearls: Writing correct programs – Communications of the ACM 26, 1040 (1983)
- D.Gries. A note on a standard strategy for developing loop invariants and loops – Science of Computer Programming 2, 207 (1982)
🔗
- A.Koenig. Invariants for binary search. Part I, Part II, Part III, Part IV, Part V, Part VI, Part VII, Part VIII, Part IX, Part X – Dr.Dobb’s Journal
❔
- What is stability in sorting algorithms and why is it important? – Stack Overflow
🎥
- W.E.Brown. Extrema: Correctly calculating
minandmax– itCppCon (2021)