Module 1: Algorithm Analysis & Design Paradigms
This page aggregates the generated reference routes used by the learner-facing module.
- Semester:
semester-02-algorithms - App:
foundations
Read only if stuck
- Skiena: The RAM model of computation
- Skiena: Big-Oh notation
- Skiena: Growth rates and dominance relations
- Skiena: Reasoning about efficiency
- Skiena: Logarithms and their applications
- Skiena: Logarithms and summations
- Skiena: Properties of logarithms
- Skiena: Solving divide-and-conquer recurrences
- CLRS: O, Omega, Theta notation
- CLRS: Asymptotic notation formal definitions
- CLRS: Standard notations and common functions
- CLRS: Substitution method
- CLRS: Recursion tree method
- CLRS: Master method
- CLRS: Aggregate analysis
- CLRS: Accounting method
- CLRS: Potential method
- CLRS: Dynamic tables (amortized example)
- Skiena: Expressing algorithms
- Skiena: Induction and recursion
- Skiena: Prove sum i = n(n+1)/2 by induction
- Skiena: Recursive objects
- CLRS: Insertion sort (loop invariant)
- CLRS: Analyzing algorithms
- CLRS: Designing algorithms (D&C correctness)
- Skiena: Selecting the right jobs
- Skiena: Modeling the problem
- Skiena: Mergesort
- Skiena: Quicksort
- Skiena: Divide and conquer
- Skiena: Backtracking
- Skiena: Constructing all permutations
- Skiena: Search pruning
- Skiena: Sudoku (pruning case study)
- CLRS: Designing algorithms (D&C template)
- CLRS: Activity selection
- CLRS: Elements of the greedy strategy
- CLRS: Huffman codes
- Competitive Programming: Complete search
- Competitive Programming: Divide and conquer
- Competitive Programming: Greedy
- Competitive Programming: Greedy examples
- Skiena: Fibonacci by recursion
- Skiena: Fibonacci by caching
- Skiena: Approximate string matching
- Skiena: Edit distance by DP
- Skiena: Longest increasing subsequence
- Skiena: Limitations of DP (TSP)
- CLRS: Rod cutting
- CLRS: Matrix chain multiplication
- CLRS: Elements of dynamic programming
- CLRS: Offline caching (greedy vs DP)
- Competitive Programming: DP
- Competitive Programming: DP illustration
- Competitive Programming: DP classical examples
- Grokking: Dynamic programming (Part 1)
- Skiena: Matrix multiplication
- Skiena: Esoteric functions
- Skiena: War story - Give me a ticket on an airplane
- Skiena: War story - Skiena for the defense
- Skiena: War story - Hard against the clock
- Skiena: War story - And then I failed
- Skiena: Chapter notes on algorithm design
- CLRS: Algorithms as a technology
- Competitive Programming: Do algorithm analysis
- Competitive Programming: Master the art of testing code
- CLRS: Insertion sort