算法设计与分析

An Interactive Journey into Algorithm Design & Analysis

Master the art and science of algorithms through vivid visualizations and interactive simulations. From sorting and searching to graph algorithms and NP-completeness — build the foundation of computational thinking!

What You'll Explore

Part A: Foundations

  • Ch 0: Introduction & Models of Computation
  • Ch 1: Asymptotic Notation
  • Ch 2: Recurrences & Master Theorem
  • Ch 3: Amortized Analysis

Part B: Divide & Conquer

  • Ch 4: Merge Sort & D&C Paradigm
  • Ch 5: Quicksort & Randomization
  • Ch 6: Selection, Strassen & FFT
  • Ch 7: Sorting Lower Bounds & Linear Sort

Part C: Data Structures

  • Ch 8: Heaps & Priority Queues
  • Ch 9: BST & Balanced Trees
  • Ch 10: Hash Tables & Skip Lists
  • Ch 11: Union-Find / Disjoint Sets

Part D: Graph Algorithms

  • Ch 12: BFS & DFS
  • Ch 13: Topological Sort & SCC
  • Ch 14: Shortest Paths
  • Ch 15: Minimum Spanning Trees

Part E: Algorithm Paradigms

  • Ch 16: Greedy Algorithms
  • Ch 17: Dynamic Programming
  • Ch 18: Backtracking & Branch and Bound

Part F–G: Flow & Complexity

  • Ch 19: Max-Flow & Min-Cut
  • Ch 20: NP-Completeness & Reductions
  • Ch 21: Approximation & Randomized Algorithms

Select a chapter from the sidebar to begin your journey!