Left Rotate Array by K Positions

#include <stdio.h>

static void reverse_int(int *a, size_t l, size_t r) {
    while (l < r) {
        int tmp = a[l];
        a[l] = a[r];
        a[r] = tmp;
        l++;
        r--;
    }
}
void rotate_left(int arr[], int n, int k) {
    // Your logic here
    if (!arr || n == 0) return;

    k %= n;               // handle k >= n
    if (k == 0) return;   // no change

    reverse_int(arr, 0, k - 1);
    reverse_int(arr, k, n - 1);
    reverse_int(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;
}