Left Rotate Array by K Positions

Code

#include <stdio.h>

void rotate_left(int arr[], int n, int k) {
int i,j;
for(i = 0; i < k; i++)
{
for(j = 0;j < n-1; j++)
{
    arr[j] = arr[j] ^ arr[j+1];
    arr[j+1] = arr[j] ^ arr[j+1];
    arr[j] = arr[j] ^ arr[j+1];

}
}
}
int main() {
    int n, k;
    scanf("%d %d", &n, &k);

    int arr[100];

    // Read array elements
    for (int i = 0; i < n; i++) {
        scanf("%d", &arr[i]);
    }

    // Rotate the array
    rotate_left(arr, n, k);

    // Print the rotated array
    for (int i = 0; i < n; i++) {
        printf("%d", arr[i]);
        if(i < n-1){
        	printf(" ");
        }
    }

    return 0;
}

Solving Approach

 

 

 

Upvote
Downvote
Loading...

Input

5 2 1 2 3 4 5

Expected Output

3 4 5 1 2