The Design & Analysis of Algorithms
Nitin Upadhyay
- India S.K Katara & Sons 2016-2017
- xiii,502. pager
Algorithm (Page-1-33), Growth of Function (Page-34-66),Analysing Algorithm Control Structures (Page-67-78),Recurrences (Page-79-102),Quick Sort (Page-103-109),Elementary Data Structure (Page-110-150),Amortized Analysis (Page-151-157),Heap (Page-158-198),Sorting in Linear Time (Page-199-207),Median and Order Statistics (Page-208-213),Searching and Advanced Search Trees (Page-214-288),Dynamic Programming (Page-289-310),Greedy Algorithms (Page-311-332),Bracktracking (Page-333-344),Branch and Bound (Page-345-350),Graphs (Page-351-419),String Matching (Page-420-431),Augmenting Data Structures (Page-432-437),NP Completeness (Page-438-457),Polynomials and the FFT (Page-458-463),Randomized Algorithms (Page-464-466),Algebraic Computation (Page-467-474),