Brand Waali Quality, Bazaar Waali Deal!
Our Blog
Help Center
Sell On Snapdeal
Download App
Cart
Sign In

Sorry! Introduction to Algorithms (Eastern Economy Edition) Paperback – 2 Feb 2010 by Thomas H. Cormen (Author), Charles E. Leiserson (Author), Ronald L. Rivest (Author), Clifford Stein (Author) is sold out.

Compare Products
Clear All
Let's Compare!

Introduction to Algorithms (Eastern Economy Edition) Paperback – 2 Feb 2010 by Thomas H. Cormen (Author), Charles E. Leiserson (Author), Ronald L. Rivest (Author), Clifford Stein (Author)

This product has been sold out
(5.0) 1 Rating 1 Review Have a question?

pay
Rs  812
We will let you know when in stock
notify me

Highlights

  • ISBN13:978-8120340077
  • ISBN10:8120340078
  • Publisher:PHI Learning Pvt. Ltd. (Originally MIT Press); Third edition (2 February 2010)
  • Language:English
  • Author:Thomas H. Cormen (Author), Charles E. Leiserson (Author), Ronald L. Rivest (Author),
  • Binding:Paperback
  • Publishing Year:2010
  • Pages:1295
  • SUPC: SDL610981861

Other Specifications

Other Details
Country of Origin or Manufacture or Assembly India
Common or Generic Name of the commodity Algorithms Books
Manufacturer's Name & Address
Packer's Name & Address
Marketer's Name & Address
Importer's Name & Address

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 selfcontained 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 edgebased 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 selfstudy by technical professionals.

Terms & Conditions

The images represent actual product though color of the image and product may slightly differ.

Snapdeal does not select, edit, modify, alter, add or supplement the information, description and other specifications provided by the Seller.

Quick links

Ratings & Reviews

  • No recommendations yet.
    Would you like to recommend this item? Yes No
  • Have you used this product?

    Review
Rating info is based on overall customer ratings

Questions & Answers

Have a Question?

Get answers from experts and customers who have used this item.

Seller Details

View Store


New Seller
Expand your business to millions of customers