Left Rotate Array by K Positions

#include <stdio.h>

void reverse_arr(int arr[], int start, int end)
{
    while(start < end)
    {
        int tmp = arr[start];
        arr[start] = arr[end];
        arr[end] = tmp;
        end--;
        start++;
    }
}
void rotate_left(int arr[], int n, int k) {
    // Your logic here
    //uint8_t tmp1 = arr[0]; 
    if (n == 0) return;
    k %=n;
    if(k==0) return;
    //reverse from 0 k-1
    reverse_arr(arr, 0, k-1); 
   
    //reverse from k to n-1
    reverse_arr(arr, k, n-1);

    //reverse from 0 to n-1
    reverse_arr(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;
}