| Step | Arrangement |
|---|---|
| Input | pear fig apple kiwi date |
| I | apple pear fig kiwi date |
| II | apple date pear fig kiwi |
| III | apple date fig pear kiwi |
| IV | apple date fig kiwi pear |
Find what moves at Step I, confirm at Step II, then apply the rule. A machine with n words finishes in at most n - 1 steps.
Key takeaways: describe the rule in words, check it on two steps, and write each step in full.