See what we can offer to your school
"SimpleStudy just makes sense...”
Get the best plan for your school
12 questions from this quiz
Minimum number of operations
Maximum number of operations
O(n)O(n)O(n)
O(logn)O(\log n)O(logn)
Data must be sorted
O(n2)O(n^2)O(n2)
Pivot is smallest/largest repeatedly
O(nlogn)O(n \log n)O(nlogn)
Uses significant extra memory
Average case = worst case
Select your subjects, and get access to A+ resources today.