For example, the permutation of 3, 1, 4, 2 would require manipulation from 00, 01, 10, 11 to 10, 00, 11, 01. Note that this permutation is represented with two bits since , where is the number of bits and is the permutation length. The object of this Demonstration is to exhibit how any permutation can be achieved (even across bits) using only the two simple operations of transposition and shifting. However, in practical applications this algorithm should obviously be substantially optimized, as it is often incredibly inefficient, especially as the bit count increases.