Left Rotate Array by K Positions

Code

#include <stdio.h>

void reverse_arr(int arr[], int n){
    int temp;
    for(int i=0;i<(n/2);i++){
        temp=arr[i];
        arr[i]=arr[n-1-i];
        arr[n-1-i]=temp;
    }
}
void rotate_left(int arr[], int n, int k) {
    // Your logic here
    //reversal algorithm 
    k=k%n;
    reverse_arr(arr,k);
    reverse_arr(arr+k,n-k);
    reverse_arr(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

reversal algorithm , first divide the array into two parts based on k, then reverse both array, separately and finally reverse the entire array.