Left Rotate Array by K Positions

Code

#include <stdio.h>

void rotate_left(int v[], int n, int k) {
    // Your logic here
    k = k % n;
    if(k<=0 || n<=1)
        return;
    for(int i = 0;i<n-k;i++){
        v[i] = v[i] + v[i+k];
        v[i+k] = v[i] - v[i+k];
        v[i] = v[i] - v[i+k];
    }
    rotate_left(v+n-k,k,k-(n%k));
}

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