Growth of Function 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 Strutures for Disjoint Sets Backtracking Branch and Sounds Elementary Graph Algorithms Minimum Spanning Tree Single Source Shortest Paths All Pairs Shortest Path Maximum Flow Sorting Networks Matrix Operations Polynomials and the FFT Number Theoretic Algorithms String Matching NP-Completeness Approximation Algorithms

This book provides a treatment of designing procedures of algorithms and how to analyze algorithms. The book is applicable for courses in data structures and algorithms.