As example 4.2 illustrates, a sequence may be completely sorted several iterations before procedure ODD-EVEN TRANSPOSITION actually terminates. In fact, if the sequence is initially sorted, the 0(n)...

As example 4.2 illustrates, a sequence may be completely sorted several iterations before procedure ODD-EVEN TRANSPOSITION actually terminates. In fact, if the sequence is initially sorted, the 0(n) iterations performed by the procedure would be redundant. Is it possible, within the limitations of the linear array model, to modify the procedure so that an early termination is obtained if at any point the sequence becomes sorted?