The problem of interchanging tw segments of an array is considered.Using the known methods as a starting-point, two new adaptations
are developed that achieve higher memory locality. It is confirmed, both analytically and experimentally, that on a computer
with a hierarchical memory the adaptations are superior to the earlier methods.