Put bubble sort and insertion sort head-to-head on the exact same shuffled array.
Bubble sort repeatedly swaps adjacent out-of-order values; insertion sort shifts values into a sorted prefix. Both are O(n²) in the worst case, but their actual operation counts differ.