What Is An Algorithm?,Algorithm Specification,Performance Analysis,Randomized Algorithms,References And Readings,Elementary Data Structures, Stacks And Queues, Trees, Dictionaries, Priority Queues, Sets And Disjoint Set Union,Divide-And-Conquer,General Method,Binary Search,Finding The Maximum And Minimum,Merge Sort,Quicksort,Selection,Strassen's Matrix Multiplication,Convex Hull,The Greedy Method,The General Method,Knapsack Problem,Tree Vertex Splitting,Job Sequencing With Deadlines,Minimum-Cost Spanning Trees,Optimal Storage On Tapes,Optimal Merge Pateerns,Single-Source Shortest Paths,Dynamic Programming,The General Method,Multistage Graphs,All Pairs Shortest Pattis,Single-Source Shortest Paths,General Weights,Optimal Binary Search Trees,String Editing,0/I-Knapsack,Reliability Design,The Traveling Salesperson Problem,Flow Shop Scheduling,Basic Traversal And Search Techniques,Techniques For Binary Trees,Techniques For Graphs,Connected Components And Spanning Trees,Biconnected Components And Dfs,Backtracking,The General Method,The 8-Queens Problem,Sum Of Subsets,Graph Coloring,Hamiltonian Cycles,Knapsack Problem,Branch-And-Bound,The Method,0/1 Knapsack Problem,Traveling Salesperson (S),Efficiency Considerations,Evaluation And Interpolation,The Fast Fourier Transform,Modular Arithmetic,Even Faster Evaluation And Interpolation,Lower Bound Theory,Comparison Trees,Oracles And Adversary Arguments,Lower Bounds Through Reductions,Np-Hard And Np-Complete Problems,Cook's Theorem,Np-Hard Graph Problems,Np-Hard Scheduling Problems,Np-Hard Code Generation Problems,Some Simplified Np-Hard Problems,Approximation Algorithms,Absolute Approximations, Gapproximations,Computing The Convex Hull,Lower Bounds,Mesh Algorithms,Computational Model,Packet Routing,Fundamental Lgorithms,Selection,Merging,Sorting,Graph Problems, Computing The Convex Hull, Hypercube Algorithms, Computational Model,Ppr Routing,Fundamental Algorithms,Selection,Merging,Sorting,Graph Problems.