See what we can offer to your school
"SimpleStudy just makes sense...”
Get the best plan for your school
12 cards from this deck
Divide-and-conquer
Comparison-based sorting
Splits array: smaller left, larger right
Minimal additional memory required
O(nlogn)O(n \log n)O(nlogn)
O(n2)O(n^2)O(n2)
Pivot divides array poorly
Choose a pivot
Partition array around pivot
Recursively apply to sub-arrays
First, last, or middle element
Random pivot or median-of-three
Select your subjects, and get access to A+ resources today.