旋转函数，使用C中的递归，接受数组和整数作为输入

#include <stdio.h>

void rotateArray(int arr[], int n, int k) {
    if (k == 0) {
        return;
    }
    
    int temp = arr[n-1];
    for (int i = n-1; i > 0; i--) {
        arr[i] = arr[i-1];
    }
    arr[0] = temp;
    
    rotateArray(arr, n, k-1);
}

int main() {
    int arr[] = {1, 2, 3, 4, 5};
    int n = sizeof(arr) / sizeof(arr[0]);
    int k = 2;
    
    rotateArray(arr, n, k);
    
    printf("Rotated array: ");
    for (int i = 0; i < n; i++) {
        printf("%d ", arr[i]);
    }
    
    return 0;
}