A best-seller in its French edition, this book details 150 problems, spanning on seven families of algorithms. For each problem, a precise and progressive statement is given. More important, a complete solution is detailed, with respect to the design principles that have been presented; often, some classical errors are pointed at.
A best-seller in its French edition, this book details 150 problems, spanning on seven families of algorithms. For each problem, a precise and progressive statement is given. More important, a complete solution is detailed, with respect to the design principles that have been presented; often, some classical errors are pointed at.
Patrick Bosc, Marc Guyomard, and Laurent Miclet are former professors at Enssat, Engineering school of University of Rennes, France and senior researchers at IRISA. They have taught Data Structures, Algorithmic, Databases, Formal methods, Language theory, Compiling, etc. for numerous years at the Bachelor and Master levels.
Inhaltsangabe
Table of Contents Preface 1. Mathematics and Computer Science: Some Useful Notions 2. Complexity of an Algorithm 3. Specifications, Invariants, Iteration 4. Reduce and Conquer, Recursion 5. Generate and Test 6. Branch and Bound 7. Greedy Algorithms 8. Divide and Conquer 9. Dynamic Programming Notations List of Problems Bibliography Index
Table of Contents Preface 1. Mathematics and Computer Science: Some Useful Notions 2. Complexity of an Algorithm 3. Specifications, Invariants, Iteration 4. Reduce and Conquer, Recursion 5. Generate and Test 6. Branch and Bound 7. Greedy Algorithms 8. Divide and Conquer 9. Dynamic Programming Notations List of Problems Bibliography Index
Es gelten unsere Allgemeinen Geschäftsbedingungen: www.buecher.de/agb
Impressum
www.buecher.de ist ein Shop der buecher.de GmbH & Co. KG Bürgermeister-Wegele-Str. 12, 86167 Augsburg Amtsgericht Augsburg HRA 13309