Amazon cover image
Image from Amazon.com
Image from Google Jackets

Algorithm design : a methodological approach--150 problems and detailed solutions / Lauren Miclet, Patrick Bosc, & Marc Guyomard.

By: Contributor(s): Material type: TextTextLanguage: English Original language: French Publication details: London : CRC Press , 2023.Edition: 1st edDescription: 820p. : IllISBN:
  • 9781032369419
  • 9781032369396
Uniform titles:
  • Conception d'algorithmes. English
Subject(s): DDC classification:
  • 518 23/eng20221128 PAT
LOC classification:
  • QA9.58 .B6713 2023
Contents:
Table of Contents Mathematics and Computer Science: Some Useful Notions Complexity of an Algorithm Specifications, Invariants, Iteration Reduce and Conquer, Recursion Generate and Test Branch and Bound Greedy Algorithms Divide and Conquer Dynamic Programming Notations List of Problems.
Summary: A best-seller in its French edition, the construction of this book is original and its success in the French market demonstrates its appeal. It is based on three principles: 1. An organization of the chapters by families of algorithms : exhaustive search, divide and conquer, etc. At the contrary, there is no chapter only devoted to a systematic exposure of, say, algorithms on strings. Some of these will be found in different chapters. 2. For each family of algorithms, an introduction is given to the mathematical principles and the issues of a rigorous design, with one or two pedagogical examples. 3. For its most part, the 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. Roughly speaking, two thirds of the book are devoted to the detailed rational construction of the solutions.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)

Translation of: Conception d'algorithmes / Patrick Bosc, Marc Guyomard, Laurent Miclet. 2016.

Includes bibliographical references and index.

Table of Contents

Mathematics and Computer Science: Some Useful Notions

Complexity of an Algorithm

Specifications, Invariants, Iteration

Reduce and Conquer, Recursion

Generate and Test

Branch and Bound

Greedy Algorithms

Divide and Conquer

Dynamic Programming
Notations

List of Problems.

A best-seller in its French edition, the construction of this book is original and its success in the French market demonstrates its appeal. It is based on three principles: 1. An organization of the chapters by families of algorithms : exhaustive search, divide and conquer, etc. At the contrary, there is no chapter only devoted to a systematic exposure of, say, algorithms on strings. Some of these will be found in different chapters. 2. For each family of algorithms, an introduction is given to the mathematical principles and the issues of a rigorous design, with one or two pedagogical examples. 3. For its most part, the 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. Roughly speaking, two thirds of the book are devoted to the detailed rational construction of the solutions.

There are no comments on this title.

to post a comment.