Big O
Turn the growth classes on and off, set the constant in front of each one, and read off the n where one overtakes another.
The number beside each class is the constant in front of it. Big O throws those away, but your laptop does not, and they are what decides which algorithm wins at the sizes you actually run.
Found by walking n upwards and watching for the order to flip, so each answer is the first whole n where the one behind has caught up. Two curves that start level at n = 1 and never swap are not a crossing, so they are left out.
One measurement per line, n first, then the operations you counted. The numbers below come from bubble sort on the sorting page.