It follows that an upper bound for the minimum number of adjacent task swappings needed from \(\Gamma _{\pi _1}^{C(n)}\)  to reach \(\Gamma _{\pi _2}^{C(n)}\)  in Algorithm  is the diameter of a complete transposition graph \(\text{CT}_n\) , which is \(n-1\)  [1]}.
