See what we can offer to your school
"SimpleStudy just makes sense...”
Get the best plan for your school
12 cards from this deck
Algorithm efficiency: upper bound of growth rate, worst-case performance
How execution time increases with input size
How memory usage increases with input size
Performance unaffected by input size
Accessing an array element
Performance grows logarithmically with input size
Binary search
Performance grows linearly with input size
Bubble sort
Performance doubles with each additional input element
O(n2)O(n^2)O(n2)
Drop lower-order terms and constants
Select your subjects, and get access to A+ resources today.