See what we can offer to your school
"SimpleStudy just makes sense...”
Get the best plan for your school
10 cards from this deck
Step-by-step instructions to solve a problem or perform a task
Input, Process, Output
Efficiency in time/resources as input size nnn grows
Upper bound of an algorithm's complexity
Constant time (independent of input size)
Linear time (directly proportional to input size)
Quadratic time (e.g., nested loops)
Logarithmic time (e.g., binary search)
O(n3)O(n^3)O(n3)
O(Elogn)O(E \log n)O(Elogn) where EEE is number of edges
Select your subjects, and get access to A+ resources today.