Introduction To The Design & Analysis Of Algorithms

by Anany V. Levitin

Based on a 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.

Genres: Computer Science, Algorithms, Programming, Nonfiction, Textbooks, Reference, Science

562 pages, Paperback

First published January 1, 2002

Reviews

[Abbie]

Pretty good introduction to algorithms. The writing style wasn't overly dry or boring. The explanations usually made sense, but occasionally felt lack in details. Some of the problem questions were quite difficult and sometimes seemed unrelated to the on page instruction material. The solutions manual helped me understand most of the difficult problems, but some were still ambiguous. This is a good textbook for use with a class, but perhaps not so great for self-learning unless you can find a community to further explain concepts and problems.

[Pramod]

This book is the greatest written book on algorithmic thinking. Among hundreds of topics taught in Computer Science program, I fell madly in love with one topic and that is because of this book. The book introduced me to my girlfriend -- algorithms or algorithmic thinking. I went to Ph.D. in Algorithms because of this love. I credit this book in teaching me the art and science of algorithmic thinking to nail real-life problems.

[Marian H]

Concise chapters, engaging writing style, and fun historical asides. I appreciated the pseudocode throughout the book and the exercise hints in the back of the book. I did have to resort to internet videos for some of the concepts, so this book is not a one-stop shop. However, it's still one of the better computer science textbooks out there.

[John Smith]

Pretty good. Difficult subject but good book. Pretty clearly presented.

[Jason]

I would give this a 3.5-4.0 rating as it isn't the most crystal-clear book. It impressively uses the most straightforward, casual language possible to describe a very complex topic. The exercises are challenging, though, and I don't feel the text adequately scaffolded them. Algorithms is one of those courses you have to revisit repeatedly, so I suspect I will have to dig into more sources.

[Rohan]

The questions in the book are interesting but when approaching them with just the explanation from the book it requires some serious thinking - explanations are okay from the book though. Good for students and interview prep

[J.T.]

Wish the book took a more straight forward approach to each algorithm. Feels like it jumps around.

[Jyotiprakash Mishra]

good

[Mochammad]

Buku yang sangat menarik...haha *fingercrossed*
Untuk ukuran texbook kuliah, ini termasuk buku yg sangat mudah dipahami, penjelasanya bagus dan sederhana

[Pradeep Prajapati]

Study

[Delhi Irc]

Location: GG6 IRC
Accession no: DL026768

[Abdul Rub]

best book

[Mayur]

k

[Su Myat]

Very good book for algorithms and analysis for programming. Included lots of exercise