“…We have loops (1, 1), (5,5), (6,6), (10,10) in the dependency graph, and so, the operations ed 1 , ed 5 , ed 6 and ed 10 cannot be applied in any strategy applicable to G. We have cycle 8 3 8 in Γ π and so, neither operation ed 3 , nor operation ed 8 can be applied in any strategy applicable to π. The dependency graph Γ π suggests the following order of operations to be applied in any sorting strategy of π: ed 2 should be applied before ed 7 , and ed 4 should be applied before ed 9 .…”