The sorting algorithm pre-decrements the index to backtrack one position whenever it finds an out-of-order element.

When debugging the loop, she noticed several post-decrements that caused off-by-one errors.

By pre-decrementing the counter before each check, the loop avoids processing the last element twice.

By post-decrementing the index within the loop, the programmer inadvertently skipped an element.