Left Rotate Array by K Positions

Code

#include <stdio.h>
#include <stdlib.h>

void swap(int *d, int s, int e) {
    int tmp;
    while (s < e) {
        tmp = d[s];
        d[s] = d[e];
        d[e] = tmp;
        s++;
        e--;
    }
}

void rotate_left(int arr[], int n, int 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;
}

Solving Approach