Amazon cover image
Image from Amazon.com

Introduction to the design and analysis of algorithms / Anany Levitin.

By: Material type: TextTextPublication details: Boston, Massachusetts : Pearson, c2012Edition: Third editionDescription: xxiv, 565 pages : illustrations ; 23 cmISBN:
  • 9780132316811
Subject(s): LOC classification:
  • QA 76.9.A43 .L48 2012
Contents:
Fundamentals of the analysis of algorithm efficiency -- Brute force and exhaustive search -- Decrease-and-conquer -- Divide-and-conquer -- Transform-and-conquer -- Space and time trade-offs -- Dynamic programming -- Greedy technique -- Iterative improvement -- Limitations of algorithm power -- Coping with the limitations of algorithm power.
Summary: Based on a new classification of algorithm design techniques and a clear delineation of analysis methods, Introduction to the Design and Analysis of Algorithms presents the subject in a coherent and innovative manner. Written in a student-friendly style, the book emphasizes the understanding of ideas over excessively formal treatment while thoroughly covering the material required in an introductory algorithms course. Popular puzzles are used to motivate students' interest and strengthen their skills in algorithmic problem solving. Other learning-enhancement features include chapter summaries, hints to the exercises, and a detailed solution manual.
Item type: Books
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)
Holdings
Item type Current library Home library Collection Call number Copy number Status Date due Barcode
Books Books National University - Manila LRC - Main General Circulation Computer Science GC QA 76.9.A43 .L48 2012 (Browse shelf(Opens below)) c.1 Available NULIB000006747

Includes bibliographical references and index.

Fundamentals of the analysis of algorithm efficiency -- Brute force and exhaustive search -- Decrease-and-conquer -- Divide-and-conquer -- Transform-and-conquer -- Space and time trade-offs -- Dynamic programming -- Greedy technique -- Iterative improvement -- Limitations of algorithm power -- Coping with the limitations of algorithm power.

Based on a new classification of algorithm design techniques and a clear delineation of analysis methods, Introduction to the Design and Analysis of Algorithms presents the subject in a coherent and innovative manner. Written in a student-friendly style, the book emphasizes the understanding of ideas over excessively formal treatment while thoroughly covering the material required in an introductory algorithms course. Popular puzzles are used to motivate students' interest and strengthen their skills in algorithmic problem solving. Other learning-enhancement features include chapter summaries, hints to the exercises, and a detailed solution manual.

There are no comments on this title.

to post a comment.