Last Minute Notes
Github
Docs
Learn
Search
⌘
K
@sayanstwt
Lessons
Learn
/
Data Structures & Algorithms
/
Foundations
Constraints to Complexity
6 min
Beginner
7 steps
Read n from the constraints and know which algorithm will fit.
n
10^5
Budget
~10^8 ops/s
Idea
nested loops
10^X OPS
8
O( )
1 sec
a machine does roughly 10^8 simple operations per second
current
done
skipped
In this lesson
Step 1 of 7
1
The problem
2
Budget
3
The table
4
Small n
5
Huge n
6
O(n²) hint
7
Recap