Block Swap Algorithm [for Array Rotation]

This article discusses Block Swap Algorithm. It is used to rotate an array by any number of positions with a Time Complexity of O(N) and Space Complexity of O(1).

Table of contents:

Problem statement of Array RotationBlock Swap AlgorithmExample: Dry Run of Block Swap AlgorithmImplementation of Block Swap AlgorithmTime Complexity of Block Swap AlgorithmSpace Complexity of Block Swap Algorithm

Let us get started with Block Swap Algorithm.

Problem statement of Array Rotation

Before we discus...