Left Rotate Array by K Positions

Solving Approach

if (1,2,3,4,5) and k = 2 
then

first revers = (2,1,3,4,5)

second revers = (2,1,5,4,3)

third revers = (3,4,5,1,2)

done

Code

#include <stdio.h>

void reverse_array(int arr[], int start, int end) {
    int temp = 0;
    while(start < end){
        temp = arr[start];
        arr[start] = arr[end];
        arr[end] = temp;
        start++;
        end--;
    }
}

void rotate_left(int arr[], int n, int k) {
    k = k % n;
    reverse_array(arr, 0 , k-1);
    reverse_array(arr, k , n-1);
    reverse_array(arr, 0 , n-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;
}