Left Rotate Array by K Positions

Code

#include <stdio.h>
void print_array(int *arr, int n)
{
    for(int i = 0; i < n; i++)
    {
        printf("%d ", arr[i]);
    }
    printf("\n");
}

void rotate_left(int arr[], int n, int k) {
    // Your logic here
    //to avoid excess rotation
    k = k % n;
    int temp = 0, i =0;
    for(i = 0; k>0 && i<=k && k+i < n; i++)
    {
        temp = arr[i];
        arr[i] = arr[k+i];
        arr[k+i] = temp;
        // print_array(arr,n);
    }
    for(; k>0 && i < n-1; i++)
    {
        temp = arr[i];
        arr[i] = arr[i+1];
        arr[i+1] = temp;
        // print_array(arr,n);
    }
}

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