Pensumoversikt AlgDat

Del 1 - Foundations

• Kapittel 1 - The Role of Algorithms in Computing
• Kapittel 2 - Getting Started
• Kapittel 3 - Characterizing Running Times
• Kapittel 4 - Divide-and-Conquer

Del 3 - Data Structures

• Kapittel 6 - Heapsort
• Kapittel 7 - Quicksort
• Kapittel 8 - Sorting in Linear Time
• Kapittel 9 - Medians and Order Statistics
• Kapittel 10 - Elementary Data Structures
• Kapittel 11 - Hash Tables
• Kapittel 12 - Binary Search Trees

Del 4 - Advanced Design and Analysis Techniques

• Kapittel 15 - Greedy Algorithms
• Kapittel 16 - Amortized Analysis

Del 5 - Advanced Data Structures

• Kapittel 19 - Data Structures for Disjoint Sets

Del 6 - Graph Algorithms

• Kapittel 20 - Elementary Graph Algorithms
• Kapittel 21 - Minimum Spanning Trees
• Kapittel 22 - Single-Source Shortest Paths
• Kapittel 23 - All-Pairs Shortest Paths
• Kapittel 24 - Maximum Flow
• Kapittel 25 - Matchings in Bipartite Graphs