Sinossi
Intended for one or two term introductory courses in discrete mathematics, this book offers an introduction through an algorithmic approach that focuses on problem-solving techniques. It stresses the importance of reading and doing proofs, and presents a discussion of algorithms, recursive algorithms, and the analysis of algorithms.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
