Question 4
Each beaver holds a number card. They sort themselves into increasing order from left to right. Compare the first two beavers and swap them if the first number is larger. Then compare the second and third, then the third and fourth, and so on. After the rightmost pair, restart from the left. Stop only after a full pass with no swap. The example sorts 8,5,4.
Starting with the five beavers below, how many swaps are needed?
Starting with the five beavers below, how many swaps are needed?