在C中按顺序在数组中移位

#include <stdio.h>

void leftShift(int arr[], int n, int steps) {
    int i, j;
    for (i = 0; i < steps; i++) {
        int temp = arr[0];
        for (j = 0; j < n - 1; j++) {
            arr[j] = arr[j + 1];
        }
        arr[n - 1] = temp;
    }
}

int main() {
    int arr[] = {1, 2, 3, 4, 5};
    int n = sizeof(arr) / sizeof(arr[0]);
    int steps = 2;

    leftShift(arr, n, steps);

    printf("Array after left shift: ");
    for (int i = 0; i < n; i++) {
        printf("%d ", arr[i]);
    }
    printf("\n");

    return 0;
}

Array after left shift: 3 4 5 1 2

#include <stdio.h>

void rightShift(int arr[], int n, int steps) {
    int i, j;
    for (i = 0; i < steps; i++) {
        int temp = arr[n - 1];
        for (j = n - 1; j > 0; j--) {
            arr[j] = arr[j - 1];
        }
        arr[0] = temp;
    }
}

int main() {
    int arr[] = {1, 2, 3, 4, 5};
    int n = sizeof(arr) / sizeof(arr[0]);
    int steps = 2;

    rightShift(arr, n, steps);

    printf("Array after right shift: ");
    for (int i = 0; i < n; i++) {
        printf("%d ", arr[i]);
    }
    printf("\n");

    return 0;
}

Array after right shift: 4 5 1 2 3