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.
Connections
In Field
Source Wikipedia: Block swap algorithms
Sources
Wikipedia: Block swap algorithms
Lead section
In computer algorithms, block swap algorithms swap two regions of elements of an array.
In Field: Algorithms and Complexity Theory, Lead sentence
block swap algorithms swap two regions of elements of an array.
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.