|30 days from delivery||Damaged, Defective, Item not as described||Replacement|
|30 days from delivery||Exchange for colors and size, Does not fit||Exchange|
|10 days from delivery||Damaged, Item not as described||Replacement|
This internationally acclaimed textbook provides a comprehensive introduction to the modern study of computer algorithms. It covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and presents an algorithm, a design technique, an application area, or a related topic. The algorithms are described and designed in a manner to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.
The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, and substantial additions to the chapter on recurrences (now called “Divide-and-Conquer”). It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. Many new exercises and problems have been added in this edition.
The text is intended primarily for students studying algorithms or data structures. As it discusses engineering issues in algorithm design, as well as mathematical aspects, it is equally well suited for self-study by technical professionals.
1 The Role of Algorithms in Computing
2 Getting Started
3 Growth of Functions
5 Probabilistic Analysis and Randomized Algorithms
II Sorting and Order Statistics
8 Sorting in Linear Time
9 Medians and Order Statistics
III Data Structures
10 Elementary Data Structures
11 Hash Tables
12 Binary Search Trees
13 Red-Black Trees
14 Augmenting Data Structures
IV Advanced Design and Analysis Techniques
15 Dynamic Programming
16 Greedy Algorithms
17 Amortized Analysis
V Advanced Data Structures
19 Fibonacci Heaps
20 Van Emde Boas Trees
21 Data Structures for Disjoint Sets
VI Graph Algorithms
22 Elementary Graph Algorithms
23 Minimum Spanning Trees
24 Single-Source Shortest Paths
25 All-Pairs Shortest Paths
26 Maximum Flow
VII Selected Topics
27 Multithreaded Algorithms
28 Matrix Operations
29 Linear Programming
30 Polynomials and the FFT
31 Number-Theoretic Algorithms
32 String Matching
33 Computational Geometry
35 Approximation Algorithms
VIII Appendix: Mathematical Background
B Sets, Etc.
C Counting and Probability
|Authored By||Charles E. Leiserson, Thomas H. Cormen, Ronald L. Rivest, Clifford Stein|
|Number of Pages||1312 Pages|
|Book Type||Study Book|
|University Books Details|
|University||Indian Institute of Technology (IIT), Anna University, Uttar Pradesh Technical University (UPTU), Visvesvaraya Technological University (VTU), National Institute of Technology (NIT)|
|Degree/Diploma||B.Tech, UG, M.Tech|
|Specialization||Biotechnology, Computer Science Engineering, Information Technology Engineering, Electrical and Electronics Engineering|
|Subject||Data Structure and Algorithms, Design and Analysis of Algorithms|
|Term||1st Semester, 3rd Semester, 5th Semester, 2nd Year|
Anyone who wants to buy this book, are you in skeptic mood?
The best thing I can say about this book is
If you are an
expert-> you will be happy to remain an expert and become stronger
beginner->you will be so happy to write a review as a new person :)
Having read many books on Algorithms, this one definitely deserves a special place. I would not be flattering if I can say that this is the bible of Algorithms. Folks, if you are trying to learn Algo's and land up in niche place, this is the book you should refer.
Last not the least, thank you flipkart for giving 40% off on such a wonderful book
This is a complete book (for undergraduate level), like a bible for algorithms. With page number running into four digits, it's a very detailed and descriptive book, which makes it an excellent learning resource for beginners.
A good grip of mathematics will be of great help. However, most of what is required is put into the Appendix, so you won't have to go hunting for a piece of maths.
This is a great book, which is further solidified by the fact that it is used as a textbook for MIT (Massachusetts, USA) Undergraduate Course 'Introduction to Algorithms'.
If you are looking for short, concise and yet an elegant book on algorithms, try this:
(Fundamentals Of Algorithmics, by Brassard & Bratley)
Actually I m from the It stream but i m a little weak in the area of data structures and algorithms.I came to know about this book through flipcart and the reviews about this book helped me to absorb the rough idea of this book. So i ordered this book and thanks to the Flipcart since they delivered the book within the stipulated time. I would say that its the bible for Data structures. the concepts have been explained well and in the high class manner. the real time examples have been quoted well and the concepts can be easily understood even for the beginners.
So i would say that if u feel u r slow in Data structures, U go for this book "Intro to algorithms".... This book will turn u into the master of DS.
Thanks to the flipcart team for the delivery of this book on the exact date.....
I read 1st part of the book (as a beginner who knew almost (not totally) about algorithms). Here is what I felt
* Great description of algorithms and analysis.
* You will love the pseudo code
* Good math skills are needed. Certain algorithms are just thrown at readers as exercises - Don't skip them
* For self learners: Should take a year to complete (approx, might take more). You got to be patient to cover all areas - especially exercises.
* As a text book? : Yeah! Follow your class lecturers, refer the topic in this book at home, get the exercises done, you are King!
* This book talks about lots of topics which generally aren't covered in many books. That's why its difficult to understand, a big 1300 pgs.
* IN BRIEF:
(If you got good math, enough time and good tutor or guide, get this one)
For a passionate Comp Sci Engineer, I don't know what I was doing all these years.
I never bothered checking out this boo...
I am 16 but I literally am mad about computers.
It has extremely high level of math and is extremely hard to understand...
I would not mention any thing about the product coz everyone knows this is a world famous publication and is taught worldwide....Read More
This is the best book for understanding the concept of data structure and algorithms. Every computer science student should rea...Read More