Search preferences
Skip to main search results

Search filters

Product Type

  • All Product Types 
  • Books (1)
  • Magazines & Periodicals (No further results match this refinement)
  • Comics (No further results match this refinement)
  • Sheet Music (No further results match this refinement)
  • Art, Prints & Posters (No further results match this refinement)
  • Photographs (No further results match this refinement)
  • Maps (No further results match this refinement)
  • Manuscripts & Paper Collectibles (No further results match this refinement)

Condition Learn more

  • New (1)
  • As New, Fine or Near Fine (No further results match this refinement)
  • Very Good or Good (No further results match this refinement)
  • Fair or Poor (No further results match this refinement)
  • As Described (No further results match this refinement)

Binding

Collectible Attributes

  • First Edition (No further results match this refinement)
  • Signed (No further results match this refinement)
  • Dust Jacket (No further results match this refinement)
  • Seller-Supplied Images (No further results match this refinement)
  • Not Print on Demand (1)

Language (1)

Price

  • Any Price 
  • Under £ 20 
  • £ 20 to £ 35 (No further results match this refinement)
  • Over £ 35 (No further results match this refinement)
Custom price range (£)

Free Shipping

  • Free Shipping to U.S.A. (No further results match this refinement)

Seller Location

Seller Rating

  • Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran

    Language: English

    Published by Universities Press, 2019

    ISBN 10: 9386235145 ISBN 13: 9789386235145

    Seller: Vedams eBooks (P) Ltd, New Delhi, India

    Seller rating 4 out of 5 stars 4-star rating, Learn more about seller ratings

    Contact seller

    £ 18.97

    £ 15.11 shipping
    Ships from India to U.S.A.

    Quantity: 5 available

    Add to basket

    Soft cover. Condition: New. 2nd Edition. Contents: Preface. Index. 1. Introduction. 2. Elementary Data Structures. 3. Divide-and-Conquer. 4. The Greedy Method. 5. Dynamic Programming. 6. Basic Traversal and Search Techniques. 7. Backtracking. 8. Branch and Bound. 9. Algebraic Problems. 10. Lower Bound Theory. 11. NP-Hard and NP-Complete Problems. 12. Approximation Algorithms. 13. PRAM Algorithms. 14. Mesh Algorithms. 15. Hypercube. This is the thoroughly revised and updated edition of the text that helped establish computer algorithms as a discipline of computer science. Using the popular object-oriented language C++, the text incorporates the latest research and state-of-the-art applications, bringing this classic to the forefront of modern computer science education. A major strength of this text is its focus on design techniques rather than on individual algorithms. The second edition of Computer Algorithms/C++ emphasizes: Design techniques: Divide and conquer, the greedy method, dynamic programming, backtracking, and branch and bound are illustrated with several examples. Each algorithm is completely analyzed. Examples: A wide range of examples provides students with the actual implementation of the correct design. The latest research: A thorough treatment of probabilistic and parallel algorithms is included. Full integration of randomized algorithms: Performance with nonrandomized algorithms is thoroughly compared. Computer Algorithms/C++ is appropriate as a core text for upper- and graduate-level courses in algorithms. This edition of Computer Algorithms/C++ is distributed with a free lab manual containing solutions of the laboratory exercises prescribed by VTU for the paper titled Design and Analysis of Algorithms. The lab manual is authored by Dr K Santhi Sree, Professor, School of Information Technology, Jawaharlal Nehru Technological University (JNTUH), Hyderabad.