How to construct rigorous mathematical arguments.
Biggs formalizes recursion as a mathematical object, not just a programming trick. He introduces recurrence relations and shows how to solve them using characteristic equations and generating functions. norman l. biggs discrete mathematics pdf
While it is a pure math book, it consistently highlights applications in algorithms, data structures, and cryptography. How to construct rigorous mathematical arguments
How to measure the efficiency of mathematical procedures. it consistently highlights applications in algorithms