Reverse an Array In-Place

Code

#include <stdio.h>

void reverse_array(int arr[], int n) {
    int left = 0;
    int right = n - 1;

    // Continue swapping until the pointers meet or cross
    while (left < right) {
        // Swap arr[left] and arr[right]
        int temp = arr[left];
        arr[left] = arr[right];
        arr[right] = temp;

        // Move pointers towards the center
        left++;
        right--;
    }
}

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

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

    reverse_array(arr, n);

    for (int i = 0; i < n; i++) {
        printf("%d", arr[i]);
        if(i < n-1){
        	printf(" ");
        }
    }
    return 0;
}

Solving Approach