See what we can offer to your school
"SimpleStudy just makes sense...”
Get the best plan for your school
12 cards from this deck
Repeatedly compares adjacent elements & swaps if wrong order
One complete iteration through the list
Maintains relative order of equal elements
Requires small, constant extra memory
O(n)O(n)O(n)
O(n2)O(n²)O(n2)
Optimise & avoid unnecessary passes when list sorted
When list is already sorted
When list sorted in reverse order
Repeatedly swapping adjacent elements until sorted
Not practical - inefficient
Select your subjects, and get access to A+ resources today.