[Rekurzija] Ciklichno pomestuvanje

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

void pomesti(int *, int, int, int, int);

int main()
{
    int n, k, i;
    scanf("%d %d", &n, &k);

    k = k%n;
    int niza[n];

    for(i = 0; i < n; ++i) {
        scanf("%d", &niza[i]);
    }

    pomesti(niza, n, k, 0, niza[0]);

    for(i = 0; i < n; ++i) {
        printf("%d ", niza[i]);
    }
    return 0;
}

void pomesti(int arr[], int n, int k, int i, int first) {
    if(k > 0) {
        if(i == n-1) {
            arr[n-1] = first;
            pomesti(arr, n, k-1, 0, arr[0]);
        } else {
            arr[i] = arr[i+1];
            pomesti(arr, n, k, i+1, first);
        }
    }
}