As we know if we have an array of size n, let's say a0, a1, a2, ......, an-1.↵
we can preform x move clockwise with ((ai + x) % n) and anticlockwise with ((ai — x) % n + n) % n.↵
↵
Can we generalized for clockwise and anticlockwise for the index i to j?↵
So what will be the formula if we want to circle from ai to aj in an array(0 indexed and size of the array is n)?
we can preform x move clockwise with ((ai + x) % n) and anticlockwise with ((ai — x) % n + n) % n.↵
↵
Can we generalized for clockwise and anticlockwise for the index i to j?↵
So what will be the formula if we want to circle from ai to aj in an array(0 indexed and size of the array is n)?
