Left Rotate Array by K Positions

#include <stdio.h>

void swap(int arr[], int start, int end){
        while(start < end){
            int temp = arr[start];
            arr[start]  = arr[end];
            arr[end] = temp;
            end --;
            start ++;
        }
    
}


void rotate_left(int arr[], int n, int k) {
    // Your logic here
    k = k %n;
    swap(arr,0,k-1);
    swap(arr,k,n-1);
    swap(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;
}