What Do O(1), O(n), and O(n²) Mean?
Learn the core ideas behind What Do O(1), O(n), and O(n²) Mean? step by step.
Programming & Algorithms
Understand how code works and how algorithms solve problems.
Read code Think in steps Solve problems
13 articles
DFS, BFS, binary search, and time complexity.
BFS: Exploring Layer by Layer
Learn the core ideas behind BFS: Exploring Layer by Layer step by step.
Why Is Binary Search O(log n)?
Learn the core ideas behind Why Is Binary Search O(log n)? step by step.
Brute-Force Search: Try Every Possibility
Learn the core ideas behind Brute-Force Search: Try Every Possibility step by step.
What's the Difference Between DFS and BFS?
Learn the core ideas behind What's the Difference Between DFS and BFS? step by step.
DFS: Go as Deep as Possible
Learn the core ideas behind DFS: Go as Deep as Possible step by step.
How Are DFS and Recursion Related?
Learn the core ideas behind How Are DFS and Recursion Related? step by step.
Finding the Shortest Path with BFS
Learn the core ideas behind Finding the Shortest Path with BFS step by step.
How Can We Make a Slow Program Faster?
Learn the core ideas behind How Can We Make a Slow Program Faster? step by step.