Block Swap Algorithms

In computer algorithms, block swap algorithms swap two regions of elements of an array. Swapping two non-overlapping regions of equal size is straightforward, but swapping two contiguous regions of unequal size is not, and several named algorithms address this case, including Bentley's juggling, Gries-Mills rotation, the triple reversal algorithm, the conjoined triple reversal algorithm and successive rotation. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/