Introduction to the Design and Analysis of Algorithms, 3/e

Price:

NPR 1,296.00


Ships from Overseas

Introduction to the Design and Analysis of Algorithms, 3/e

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.

NPR 1,296.00 1296.0 NPR NPR 1,440.00

NPR 1,440.00


  • Author
  • Pages
  • Pages 592
  • Year
  • ISBN
  • Publisher
  • Language
  • Subject
  • Edition
  • Weight
  • Dimensions
  • Binding

This combination is not available.

Not in Stock. Ships in: 4-6 weeks
Details

Share :

Introduction to the Design and Analysis of Algorithms, 3/e

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. 

  • Employs an innovative and more comprehensive taxonomy of algorithm design techniques 
  • Covers mathematical analysis of both no recursive and recursive algorithms, as well as empirical analysis and algorithm visualization Discusses limitations of algorithms and ways to overcome them. 
  • Treats algorithms as problem-solving tools and develops algorithmic thinking by using puzzles and games.
  • Contains over 600 exercises with hints for students and detailed solutions for instructors
  • New exercises and engaging puzzles
Table of Contents
  1. Introduction 
  2. Fundamentals of the Analysis of Algorithm Efficiency 
  3. Brute Force and Exhaustive Search 
  4. Decrease-and-Conquer 
  5. Divide-and-Conquer 
  6. Transform-and-Conquer 
  7. Space and Time Trade-Offs 
  8. Dynamic Programming 
  9. Greedy Technique 
  10. Iterative Improvement
  11. Limitations of Algorithm Power 
  12. Coping with the Limitations of Algorithm Power.
Book
Author Levitin
Pages 592
Year 2017
ISBN 9789332585485
Publisher Pearson
Language English
Uncategorized
Subject Computer Science / Algorithm Design
Edition 3/e
Weight 748 g
Dimensions 24.4 x 20.3 x 3.7 cm
Binding Paperback