Left Rotate Array by K Positions

#include <stdio.h>

void rotate_left(int arr[], int n, int k) {
    // use a pointer that gets looped back to the start 
    int temp;

    k %= n;

    for (int i = 0; i < k/2; i++){
        temp = arr[i];
        arr[i] = arr[k-1-i];
        arr[k-1-i] = temp;
    }
    for (int j = 0; j < (n-k)/2; j++){
        temp = arr[k+j];
        arr[k+j] = arr[n-1-j];
        arr[n-1-j] = temp;
    }
    for (int m = 0; m < n/2; m++){
        temp = arr[m];
        arr[m] = arr[n-1-m];
        arr[n-1-m] = temp;
    }

    return;
}

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