Reverse an Array In-Place

Code

#include <stdio.h>

void reverse_array(int arr[], int n) {
    int mid;
    
    if (n % 2 == 0) {
        mid = (n / 2) - 1;
    } else {
        mid = (n - 1) / 2;
    }
    
    for (int i = 0; i <= mid; i++) {
        int val = arr[i];
        arr[i] = arr[n - (i + 1)];
        arr[n - (i + 1)] = val;
    }
}

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