Home | | Shopping Cart | | Track Your Order | Help | Wish List | Contact Us
> >

Introduction to Algorithms

By Thomas H Cormen (Author), Charles E Leiserson (Author)

Price Not Available
Price Not Available

Out Of Stock
Introduction to Algorithms
INR
P-M-B-9788120340077
Out Of Stock
0.0
Price Not Available
Out of Stock

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 reade 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.

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 reade 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.

Features

  • : Introduction to Algorithms
  • : Thomas H Cormen
  • : PHI Learning
  • : 8120340078
  • : 9788120340077
  • : Paperback
  • : 1312
  • : English

Look for Similar Items by Category

Disclaimer

Shipped by Infibeam.com

The following policies apply for the above product which would be shipped by Infibeam.com
1. Infibeam accept returns if the item shipped is defective or damaged
2. In case of damaged or defective product, the customer is required to raise a concern and ship the product back to us within 15 days from delivery
3. Return shipping costs will be borne by Infibeam.com
4. Infibeam will send a replacement unit as soon as the return package is received
5. Infibeam does not offer any cash refunds

Contact Us

Others

My Account

Help

Payment Options

  • Credit Cards
  • Net Banking(All Major Indian Banks)
02.jpg
Powered by infibeam