Left Rotate Array by K Positions

#include <stdio.h>

void rotate_left(int arr[], int n, int k) {

     if(k > n) k = k%n;   
     for(int i=0;i<n/2;i++)                  //Reversing the full array
     {
        int temp = arr[i];
        arr[i] = arr[(n-1)-i];
        arr[(n-1)-i] = temp;
     }

     for(int i=0;i<((n-k)-1)/2;i++)        //Reversing the first n-k elements
     {
        int temp = arr[i];
        arr[i] = arr[((n-k)-1)-i];
        arr[((n-k)-1)-i] = temp;
     }

     for(int i=0;i<k/2;i++)               //Reversing the n-k to n elements
     {
        int temp = arr[i+(n-k)];
        arr[i+(n-k)] = arr[(n-1)-i];
        arr[(n-1)-i] = 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;
}