Input Array Swaps Required 210 0 120 1 102 2 201 1 021 2 012 3 Avg 1.5 Input Array Swaps Required 210 0 120 1 102 2 201 1 021 2 012 1 Avg 1.17

A slightly more intuitive way to look at the same thing is to consider n! array permutations instead of a bitstring

array permutations instead of a bitstring Here we see that the first network has a pathologically bad case where all swaps are executed

In the second network, the first operation is guaranteed to have put either the largest or smallest element into its final position