Left Rotate Array by K Positions

#include <stdio.h>

void rotate_left(int arr[], int n, int k) {
    //Copy leftmost into buffer
    //Set i=i+1
    //Set n = buffer
    int buffer = 0;
    for(int i=0;i<k;i++){ //Loop through k times (k rotations)
        buffer = arr[0]; //Put first element in buffer
        for(int j=0;j<n-1;j++){ //Loop through each element (shift 1 place)
            arr[j] = arr[j+1]; //Shift elements
        }
        arr[n-1] = buffer; //Set last element as previous first (looped)
    }
}

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