Ebook: Introduction to algorithms [solutions]

The MIT Press, 2009. - 1312 pages. 3rd edition. ISBN-13: 978-0262033848Solutions for a select set of exercises and problems for Introduction to Algorithms, Third Edition.Contents:Selected Solutions for Chapter 2: Getting Started
Selected Solutions for Chapter 3: Growth of Functions
Selected Solutions for Chapter 4: Divide-and-Conquer
Selected Solutions for Chapter 5: Probabilistic Analysis and Randomized Algorithms
Selected Solutions for Chapter 6: Heapsort
Selected Solutions for Chapter 7: Quicksort
Selected Solutions for Chapter 8: Sorting in Linear Time
Selected Solutions for Chapter 9: Medians and Order Statistics
Selected Solutions for Chapter 11: Hash Tables
Selected Solutions for Chapter 12: Binary Search Trees
Selected Solutions for Chapter 13: Red-Black Trees
Selected Solutions for Chapter 14: Augmenting Data Structures
Selected Solutions for Chapter 15: Dynamic Programming
Selected Solutions for Chapter 16: Greedy Algorithms
Selected Solutions for Chapter 17: Amortized Analysis
Selected Solutions for Chapter 21: Data Structures for Disjoint Sets
Selected Solutions for Chapter 22: Elementary Graph Algorithms
Selected Solutions for Chapter 23: Minimum Spanning Trees
Selected Solutions for Chapter 24: Single-Source Shortest Paths
Selected Solutions for Chapter 25: All-Pairs Shortest Paths
Selected Solutions for Chapter 26: Maximum Flow