Algorithm

Right Rotation: We store the last k elements of the array into a temporary array. Then we shift all the other elements (n-k elements) to the right by k positions. Finally, we place the elements from the temporary array at the beginning of the original array. This achieves a right rotation by k positions.

Take the last k elements and store them in a temporary array.
Shift the first n-k elements to the right by k positions.
Copy the k stored elements from the temporary array to the start of the original array.

Left Rotation: We store the first k elements in a temporary array. Then we shift the remaining n-k elements to the left by k positions. Finally, we copy the elements from the temporary array to the end of the array. This achieves a left rotation by k positions.

Store the first k elements in a temporary array.
Shift the remaining elements to the left by k positions.
Copy the k stored elements to the end of the original array.

Code

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364