Design and Alalysis of Algorithms

Table of Contents Introduction Growth of Functions Recurrence Sorting Algorithms Divide and Conquer Heapsort Quicksort Sorting in Linear Time Median and Order Statistics Hash Tables Binary Search Tree AVL Tree Red Balck Tree Augmenting Data Structures Dynamic Programming Greedy Algorithms Amortized Analysis B-Tree and B++ Tree Binomial Heaps Fibonacci Heaps Data Structures for Disjoint Sets Backtracking Branch and Bound Elementary Graph Algorithms Minimum Spanning Tree Single Source Shotest Paths All Pairs Shortest Paths Minimum Flow Sorting Networks Matrix Operations Polynomials and the FFT Number Theoretic Algorithms String Mathing NP-Completeness Approximation Algorithms Previous Years Question Papers Bibliography Index ...