Thinking in Code

What is an Algorithm?

Sequences & Steps

Conditionals

Loops & Repetition

Data Structures: Organizing Information

Recursion: Solving Problems by Self-Reference

Searching & Sorting Algorithms

Trees and Graphs: Modeling Connections

Advanced Data Structures: Heaps, Tries, and Disjoint Sets

String Algorithms: Efficient Pattern Matching and Text Processing

Algorithmic Paradigms: Divide and Conquer

Greedy Algorithms and Dynamic Programming

Algorithmic Efficiency: Introduction to Big O

Choosing the Right Algorithm: Strategies and Trade-offs

Complexity Theory: P, NP, and NP-Completeness

Randomized Algorithms: Leveraging Probability for Efficiency

Advanced Graph Algorithms: Flows, Cuts, and Network Problems

Approximation Algorithms: Finding Near-Optimal Solutions for Hard Problems

Parallel and Distributed Algorithms: Architecting for Concurrency

Algorithm Design Principles: Abstraction, Refinement, and Proofs of Correctness