Left Rotate Array by K Positions

#include <stdio.h>

void rotate_left(int arr[], int n, int k) {
    // Your logic here
    k %= n; //(k = k % n) Handle cases where k >= n

    for (int i = 0; i < k; i++) 
    {
    // Store the first element
    int temp = arr[0];

        // Shift all elements one position to the left
        for (int j = 0; j < n - 1; j++) 
        {
            arr[j] = arr[j + 1];
        }

    // Move the first element to the end
    arr[n - 1] = temp;
    }
}

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;
}