• Introduction • Growth of Functions • Recurrence • Sorting Algorithms • Divide and Conquer • Heapsort • Quicksort • Sorting in Linear Time • Median and Order Statistics • Red Black Tree • Augmenting Data Structures • Dynamic Programming • Greedy Algorithms • Amortized Analysis • B-tree • Binomial Heaps • Fibonacci Heaps • Data Structures for Disjoint Sets • Backtracking • Branch and Bound • Elementary Graph Algorithms • Minimum Spanning Tree • Single Source Shortest Paths • All Pairs Shortest Paths • Maximum Flow • Sorting Networks • Matrix Operations • Polynomials and the FFT • Number Theoretic Algorithms • String Matching • NP-Completeness • Approximation Algorithms • Previous Year Question Papers • Bibliography • Index.
You have no items to compare.
Please login to access Wishltist
Fill up your details to notify you when this book will be available