Why is there a shipping charge for this item?
Sellers with Flipkart Assured waive off the delivery charge for Orders over Rs 500. For Orders under Rs 500, a nominal delivery charge is added per item.
Sellers without Flipkart Assured may or may not add a delivery charge to your Order. This is subject to Seller discretion.
What is the estimated delivery time?
Sellers generally procure and ship the items within the time specified on the product page. Business days exclude public holidays and Sundays.
Estimated delivery time depends on the following factors:
Why does the delivery date not correspond to the delivery timeline of X-Y business days?
It is possible that the Seller or our courier partners observe a holiday between the day you placed your order and the date of delivery, which is based on the timelines shown on the product page. In this case, we add a day to the estimated date. Some courier partners and Sellers do not work on Sundays and this is factored in to the delivery dates.
What do the different tags like 'In Stock', 'Available' mean?
Products‘In Stock’ are readily available with seller.
Products listed as ‘In Stock’ are readily available with seller.
'Preorder' or 'Forthcoming'
The product is not released yet. You can however ‘book’ an order for this. Shipping happens only after the product launch.
'Out of Stock'
Currently, the item is not available for sale. Use the 'Notify Me' feature to know once it is available for purchase.
Sometimes, items have to be sourced by Sellers from outside India. These items are mentioned as 'Imported' on the product page and can take at least 10 days or more to be delivered to you.
'Back In Stock Soon'
The item is popular and is sold out. You can however 'book' an order for the product and it will be shipped according to the timelines mentioned by the Seller.
The product is currently out of stock and is not available for purchase. The product could to be in stock soon. Use the 'Notify Me' feature to know when it is available for purchase.
This product is no longer available because it is obsolete and/or its production has been discontinued.
'Out of Print'
This product is not available because it is no longer published and has been permanently discontinued.
Why does the estimated delivery time vary for each seller?
Delivery times are influenced by product availability, geographic location of the Seller, your shipping destination and the courier partner's time-to-deliver to your location.
Please enter your default pin code on the product page to know more accurate delivery times on the product page itself.
Seller does not/cannot ship to my area. Why?
Enter your pincode on the product page to know whether the product can be delivered to your location.
If you haven't provided your pincode until the checkout stage, the pincode in your last used shipping address will be used to check for serviceability.
Whether your location can be serviced or not depends on:
At times Sellers prefer not to ship to certain locations. This is entirely at their discretion.
More answers in our Shipping FAQs »
|10 days from delivery||Damaged, Defective, Item not as described||Replacement|
If you have received a damaged or defective product or if it is not as described, you can raise a replacement request on the Website/App/Mobile site within 10 days of receiving the product.
Successful pick-up of the product is subject to the following conditions being met:
Know more about the Return Policy here
How do I place a Cash on Delivery (C-o-D) order?
All items that have the 'Cash on Delivery Available' icon are valid for order by Cash on Delivery. Add the item(s) to your cart and proceed to checkout. When prompted to choose a payment option, select 'Pay By Cash on Delivery'. Enter the CAPTCHA text as shown, for validation. Once verified and confirmed, your order will be processed for shipment in the time specified, from the date of confirmation. You will be required to make a cash-only payment to our courier partner at the time of delivery of your order to complete the payment.
Terms & Conditions
Cash-only payment at the time of delivery.
More answers in our Shipping FAQs »
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, 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 for this edition.
As of the third edition, this textbook is published exclusively by the MIT Press.
1 The Role of Algorithms in Computing
2 Getting Started
3 Growth of Functions
5 Probabilistic Analysis and Randomized Algorithms
II Sorting and Order Statistics
8 Sorting in Linear Time
9 Medians and Order Statistics
III Data Structures
10 Elementary Data Structures
11 Hash Tables
12 Binary Search Trees
13 Red-Black Trees
14 Augmenting Data Structures
IV Advanced Design and Analysis Techniques
15 Dynamic Programming
16 Greedy Algorithms
17 Amortized Analysis
V Advanced Data Structures
19 Fibonacci Heaps
20 Van Emde Boas Trees
21 Data Structures for Disjoint Sets
VI Graph Algorithms
22 Elementary Graph Algorithms
23 Minimum Spanning Trees
24 Single-Source Shortest Paths
25 All-Pairs Shortest Paths
26 Maximum Flow
VII Selected Topics
27 Multithreaded Algorithms
28 Matrix Operations
29 Linear Programming
30 Polynomials and the FFT
31 Number-Theoretic Algorithms
32 String Matching
33 Computational Geometry
35 Approximation Algorithms
VIII Appendix: Mathematical Background
B Sets, Etc.
C Counting and Probability