Left Rotate Array by K Positions

#include <stdio.h>

void rotate_left(int arr[], int n, int k) {
    // Your logic here
     k=k%n;
    for(int i=0;i<k/2;i++){
        int temp=arr[i];
        arr[i]=arr[k-i-1];
        arr[k-i-1]=temp;
    }
   int start=k;
   int end=n-1;
    while(start<end){
        int temp=arr[start];
        arr[start]=arr[end];
        arr[end]=temp;
        start++;
        end--;
    }
    for(int i=0;i<n/2;i++){
        int temp=arr[i];
        arr[i]=arr[n-i-1];
        arr[n-i-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]);
    }
 // 2 1 5 4 3 -> 3 4 5 1 2
    // 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;
}