PHI LOGO

PHI Learning

Helping Teachers to Teach and Students to Learn

EASTERN ECONMIC EDITION

Cormen

Intoduction to Algorithms By Cormen, Thomas H., Leiserson, Charles E., Rivest, Ronald L., Stein, C

No. of Pages :1312
Size: 17.8 X 23.5 cm
ISBN : 978-81-203-4007-7
Price : 1,695.00   1,186.50
You Save : (508.50)

Review Rating : Review Rating Intoduction to Algorithms By Cormen Intoduction to Algorithms By Cormen Intoduction to Algorithms By Cormen Intoduction to Algorithms By Cormen

Few Leading Institutions Following the Book
  • Assam University of Science and Technology
  • Assam University
  • Biju Pattnayak University of Technology
  • Central University of Bihar
  • Delhi University
  • Jadavpur University
  • Mizoram University
  • North Eastern Hill University
  • IIT Bhubneshwar
  • Maulana Abul Kalam Azad University of Technology(WBUT)
  • NIT Hamirpur
  • NIT Manipur
  • NIT Calicut
  • IIT Varanasi
  • IIT Roorkee
  • IIT Patna
  • IIT Guwahati
  • NIT Jaipur
  • NIT Manipur
  • NIT Meghalaya
  • NIT Mizoram
  • NIT Nagpur
  • NIT Patna
  • NIT Raipur
  • NIT Rourkela
  • NIT Sikkim
  • NIT Silchar
  • NIT Surathkal
  • NIT Jalandhar
  • Sardar Vallabhbhai National Institute of Technology
  • Indraprastha University
  • Delhi Technological University
  • Garhwal University - Srinagar Campus
  • Himachal Pradesh Technical University
  • Kurukshetra University
  • Lovely Professional University
  • Central University of Rajasthan
  • Jodhpur National University
  • LNM Institute of Information Technology (RTU)
  • Dr. K.N. Modi University
  • Banasthali Vidyapith
  • Indian Institute of Technology, BHU
  • Harcourt Butler Technological Institute
  • Uttarakhand Technical University
  • DIT University
  • Calicut University
  • Cochin Universituy of Science & Technology
  • Mysore University
  • Cochin University
  • Kerala University
  • Bangalore University
  • Anna University
  • Periyar University
  • Goa University
  • Gujarat University
  • Nagpur University
  • Mumbai University
  • Pune University
  • College of Engineering ,Pune
  • UKA Tarsadia University




About the book
Description:

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.

• Solution Manual is available directly from MIT Press. Please register on their website to request for the manual. Click Here !

“Introduction to Algorithms, the ‘bible’ of the field, is a comprehensive textbook covering the full spectrum of modern algorithms: from the fastest algorithms and data structures to polynomial-time algorithms for seemingly intractable problems, from classical algorithms in graph theory to special algorithms for string matching, computational geometry, and number theory. The revised third edition notably adds a chapter on van Emde Boas trees, one of the most useful data structures, and on multithreaded algorithms, a topic of increasing importance.”

—Daniel Spielman
Department of Computer Science
Yale University


Contents:

Preface

I Foundations
Introduction

1 The Role of Algorithms in Computing
2 Getting Started
3 Growth of Functions
4 Divide-and-Conquer
5 Probabilistic Analysis and Randomized Algorithms

II Sorting and Order Statistics
Introduction

6 Heapsort
7 Quicksort
8 Sorting in Linear Time
9 Medians and Order Statistics

III Data Structures
Introduction

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
Introduction

15 Dynamic Programming
16 Greedy Algorithms
17 Amortized Analysis

V Advanced Data Structures
Introduction


18 B-Trees
19 Fibonacci Heaps
20 Van Emde Boas Trees
21 Data Structures for Disjoint Sets




VI Graph Algorithms
Introduction

22 Elementary Graph Algorithms
23 Minimum Spanning Trees
24 Single-Source Shortest Paths
25 All-Pairs Shortest Paths
26 Maximum Flow

VII Selected Topics
Introduction

27 Multithreaded Algorithms
28 Matrix Operations
29 Linear Programming
30 Polynomials and the FFT
31 Number-Theoretic Algorithms
32 String Matching
33 Computational Geometry
34 NP-Completeness
35 Approximation Algorithms

VIII Appendix: Mathematical Background
Introduction

A Summations
B Sets, Etc.
C Counting and Probability
D Matrices

Bibliography
Index


Reviews

Top Reviews

» Ranked #6 among Engineering Textbooks on AMAZON.IN
Rating : 4.4 out of 5
star fill star fill star fill star fill star fill Go for it without any second thought.

By Amanshu Kataria on 16 July 2015
This book is no doubt Bible of Algorithms. I started reading this book a month ago. In the beginning I found this book quiet difficult to understand but with time I'm now comfortable with this book. It contains some mathematical stuff which I find difficult to understand but with the help of YouTube videos, Stackoverflow.com and some Google search I could easily understand. You need to have patience and go slowly with this book. Understanding each and every logic is very important since those logic could be used in the later chapters.....

»FLIPKART
Rating : 4.3 out of 5
star fill star fill star fill star fill star fill The Bible of Algorithms

By Mad Scientist on Apr 24, 2014
This 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 & Compiler Construction etc.

Write a Review
Name:
Affiliation:
Contact No:
E-mail Id:
Review:
Correspondence Address:
Rate Please: