Left Rotate Array by K Positions

Code

#include <stdio.h>
#define SWAP(A,B) ((A) ^= (B) ^= (A) ^= (B))

void rotate_left(int arr[], int n, int k) {
    // Per ogni posizione
    for (int i = 0; i < k; i++)
    {
        // Shiftare di uno a sx
        for (int j = 0; j < n - 1; j++)
            SWAP(arr[j], arr[j + 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