Introduction To Algorithms (Eastern Economy Edition)

Introduction To Algorithms (Eastern Economy Edition)

SKU: DADAX8120340078 Out of Stock
Sale price$113.94 Regular price$125.34
Sold out Save $11.40
Quantity
Add to wishlist
Add to compare
Shipping & Tax will be calculated at Checkout.
Delivery time: 3-5 business days (USA)
Delivery time: 8-12 business days (International)
15 days return policy
Payment Options

Help

If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.

Customer service

All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com

Sale & Press

If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com

Customer Reviews

Be the first to write a review
0%
(0)
0%
(0)
0%
(0)
0%
(0)
0%
(0)

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.

Shipping & Returns

Shipping
We ship your order within 2–3 business days for USA deliveries and 5–8 business days for international shipments. Once your package has been dispatched from our warehouse, you'll receive an email confirmation with a tracking number, allowing you to track the status of your delivery.

Returns
To facilitate a smooth return process, a Return Authorization (RA) Number is required for all returns. Returns without a valid RA number will be declined and may incur additional fees. You can request an RA number within 15 days of the original delivery date. For more details, please refer to our Return & Refund Policy page.

Shipping & Returns

Shipping
We ship your order within 2–3 business days for USA deliveries and 5–8 business days for international shipments. Once your package has been dispatched from our warehouse, you'll receive an email confirmation with a tracking number, allowing you to track the status of your delivery.

Returns
To facilitate a smooth return process, a Return Authorization (RA) Number is required for all returns. Returns without a valid RA number will be declined and may incur additional fees. You can request an RA number within 15 days of the original delivery date. For more details, please refer to our Return & Refund Policy page.

Warranty

We provide a 2-year limited warranty, from the date of purchase for all our products.

If you believe you have received a defective product, or are experiencing any problems with your product, please contact us.

This warranty strictly does not cover damages that arose from negligence, misuse, wear and tear, or not in accordance with product instructions (dropping the product, etc.).

Warranty

We provide a 2-year limited warranty, from the date of purchase for all our products.

If you believe you have received a defective product, or are experiencing any problems with your product, please contact us.

This warranty strictly does not cover damages that arose from negligence, misuse, wear and tear, or not in accordance with product instructions (dropping the product, etc.).

Secure Payment

Your payment information is processed securely. We do not store credit card details nor have access to your credit card information.

We accept payments with :
Visa, MasterCard, American Express, Paypal, Shopify Payments, Shop Pay and more.

Secure Payment

Your payment information is processed securely. We do not store credit card details nor have access to your credit card information.

We accept payments with :
Visa, MasterCard, American Express, Paypal, Shopify Payments, Shop Pay and more.

Related Products

You may also like

Frequently Asked Questions

  • Q: What topics are covered in 'Introduction to Algorithms'? A: The book covers a broad range of algorithms, including their design techniques, applications, and related topics. It includes chapters on Van Emde Boas trees, multithreaded algorithms, dynamic programming, and greedy algorithms.
  • Q: Is this book suitable for beginners? A: Yes, the book is designed to be accessible to readers at all levels, including beginners who have done a little programming.
  • Q: What is the page count of 'Introduction to Algorithms'? A: The book has a total of 1312 pages, providing extensive coverage of algorithms.
  • Q: When was the third edition published? A: The third edition was published on February 2, 2010, and it includes updates and new chapters.
  • Q: Who is the author of this textbook? A: The author of 'Introduction to Algorithms' is Thomas H. Cormen, along with co-authors Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein.
  • Q: What type of binding does this book have? A: The book is available in paperback binding, making it lightweight and portable.
  • Q: Is this book useful for self-study? A: Yes, the book is well-suited for self-study, especially for technical professionals who want to deepen their understanding of algorithms.
  • Q: What are the features of 'Introduction to Algorithms'? A: Features include secure packaging, easy-to-read text, and comprehensive exercises and problems added in the latest edition.
  • Q: What is the item condition of this book? A: The item condition is listed as 'Good', indicating it is in usable condition for readers.
  • Q: Are there exercises included in this edition? A: Yes, the third edition includes many new exercises and problems to enhance understanding of the material.