Track using Order ID
Login and do more!
- Track individual Orders
- View your entire Order history
- Cancel individual Orders
- Conveniently review products and sellers
Introduction To Algorithms is one of the most commonly referred texts when it comes to algorithms, and is used as a textbook in several colleges.
Summary Of The Book
The contemporary study of all computer algorithms can be understood clearly by perusing the contents of Introduction To Algorithms. Although this covers most of the important aspects of algorithms, the concepts have been detailed in a lucid manner, so as to be palatable to readers at all levels of skill.
Introduction To Algorithms has a number of chapters, each of which is self-contained, as it contains an algorithm, followed by a design technique. There is also an area of application or a related topic, so that students can find out the practical implications of the algorithm in question.
There is an introduction unit, where the foundations of algorithms are covered. At all points in the book, the jargon and technical information are presented so as to be readable by anyone who has dabbled to some extent in programming. The foundation unit seeks to enlighten the reader regarding the role algorithms play in modern computer programming and the growth of functions, among other things.
Introduction To Algorithms then moves on to Sorting and Order Statistics, introducing the concepts of Heapsort and Quicksort, and also explaining how to sort in real time. A number of other topics such as Design and Analysis and Graph Algorithms are covered in the book. One feature to note in this book is that two new chapters have been added in this third edition, one on multithreaded algorithms and another on Van Emde Boas trees.
Introduction To Algorithms is a popular book that has sold more than twenty million copies in total. In fact, it is so famous that it is commonly referred to as ‘CLRS’, after the initials of the authors. The book includes new problems and exercises in this edition.
About The Authors
Charles E. Leiserson is a professor at Massachusetts Institute of Technology, in the Electrical Engineering and Computer Science department.
Leiserson is also a Margaret MacVicar Faculty Fellow. He is part of the Computer Science and Artificial Intelligence Laboratory (CSAIL) at MIT and conducts extensive research in the field of computer science.
Thomas H. Cormen is the Professor and Chair in the department of Computer Science at Dartmouth.
He completed his Ph.D from Massachusetts Institute of Technology in 1992, and has been teaching ever since. His research interests include parallel computing and algorithm engineering.
Ronald L. Rivest is a popular cryptographer and he is the Erna Viterbi Professor of Computer Science at Massachusetts Institute of Technology.
Rivest is also a member of the CSAIL, along with Professor Leiserson, and helps draft the guidelines for the Voluntary Voting System for the Election Assistance Commission.
Clifford Stein is the Professor of Computer Science as well as IEOR at Columbia University.
Stein was also chair of the IEOR department for five years from 2008 to 2013, before which he was an Assistant and Associate Professor at Dartmouth College.
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
|University Books Details|
Information Technology Engineering, Biotechnology, Information Technology Engineering, Instrumentation and Control Engineering, Electronics and Communication Engineering, Computer Science Engineering, Computer Science Engineering, B.Sc(Computer Science), Computer Science Engineering, Computer Scienc...View More
Information Technology Engineering, Biotechnology, Information Technology Engineering, Instrumentation and Control Engineering, Electronics and Communication Engineering, Computer Science Engineering, Computer Science Engineering, B.Sc(Computer Science), Computer Science Engineering, Computer Science Engineering, Biotechnology, Instrumentation and Control Engineering, Electronics and Communication Engineering
|Term||5th Semester, 6th Semester, 3rd Semester, 7th Semester, 4th Semester|
|Publisher||PHI LEARNING PVT. LTD-NEW DELHI|
|Number of Pages||1310 Pages|
|Authored By||Al. Cormen|
Have you used this product?
Rate it now.Write a Review
Jul 24, 2015
May 2, 2015
Best book for algorithm for any level
May 1, 2015
one of the best book for algorithms
Apr 7, 2015
Bible for algorithms
Mar 31, 2015
excellent book but not recommended for self learners.
Dec 20, 2012
Good Math is required - Should be patient - Very detail descriptionI read 1st part of the book (as a beginner who knew almost (not totally) about algorithms). Here is what I felt
Oct 23, 2012
Fantabulous Book !!!Hello everybody,
Nov 16, 2011
Excellent bookThis 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.
Apr 24, 2014
The Bible of AlgorithmsThis book is literally the Bible of algorithms. Anyone wishing to call themselves a computer programmer needs to have at least a basic amount of knowledge about the creation, evaluation and implementation of algorithms, and this book more than provides that. It is used in universities all around the world. Although most of its matter may be outside the syllabus of Indian colleges, it is extremely useful while dealing with hard Computer Science subjects like Analysis & Design of Algorithms, Data Structures & Algorithms, Computer Graphics, Robotics & Artificial Intelligence, System Programming &… (Expand)
Aug 25, 2013
"The" Algorithm book for Computer / IT Engineers !Book Delivery : I received the book 2 days ahead of the stipulated delivery date. So Kudos to Flipkart Delivery Services. The book was nicely packed, and obviously included a funny bookmark provided with all book purchases from flipkart.
Apr 17, 2013
Cannot be betterI would not mention any thing about the product coz everyone knows this is a world famous publication and is taught worldwide. Only suggestion to user is to read this book in parallel with the video lectures on MIT website ( these are free lectures) This is gonna be a deadly combination :) this book will be a lot easier to learn with those video lecture .
Mar 31, 2015
excellent book but not recommended for self learners.this book is amazing specially for computer science grads who wants to level UP their knowledge and skills in programming and other stuff, but then...nothing great comes easy. you will often find yourself struggling in understanding even the basic concepts, forget about concepts, even some terms are not described properly (the book is written by MIT lecturers for post grads so.. you know what i mean right?)
Jan 31, 2015
A book must for every Computer science student!!!First of all the flipkart service:
Jan 19, 2015
good book,good delivarythis is a nice one who likes to know more about algorithms and the working of a simple program
Dec 30, 2014
Step well taken in right directionSo much has already been written in praise of this book that I really don't have any new words to appreciate!!