• Algorithm • Growth of Function • Analysing Algorithm Control Structures • Recurrences • Quick Sort • Elementary Data Structure • Amortized Analysis • Heap • Sorting in Linear Time • Median and Order Statistics • Searching and Advanced Search Trees • Dynamic Programming • Greedy Algorithms • Bracktracking • Branch and Bound • Graphs • String Matching • Augmenting Data Structures • NP Completeness • Polynomials and the FFT • Randomized Algorithms • Alzebraic Computation • Appendices • Previous Year Question Papers • 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