Filter
Add to wishlist

Introduction to algorithms eBook

$12.00

  • Delivery: Can be download immediately after purchasing. For new customer, we need process for verification from 30 mins to 24 hours.
  • Version: PDF/EPUB. If you need another version, please Contact us
  • Quality: Full page, full content, high quality images, searchable text and you can print it.
  • Compatible Devices: Can be read on any devices (Kindle, NOOK, Android/IOS devices, Windows, MAC,..).
  • e-Book Features: Purchase and read your book immediately, access your eTextbook anytime and anywhere, unlimited download and share with friends.
  • Note: If you do not receive the download link within 15 minutes of your purchase, please Contact us. Thank you!
  • 5% off all orders over $25 with code:: 5OFF2024
  • 10% off all orders over $50 with code: 10OFF2024
SKU: 9780262033848 Categories: ,

The latest edition of the essential text and professional reference, with substantial new material on such topics as vEB trees, multithreaded algorithms, dynamic programming, and edge-based flow. Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book 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 can be used as a unit of study. The algorithms are described in English and in a pseudocode designed 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 first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, substantial additions to the chapter on recurrence (now called “Divide-and-Conquer”), and an appendix on matrices. 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 exercises and problems have been added for this edition. The international paperback edition is no longer available; the hardcover is available worldwide.
Additional ISBNs