Reverse an Array Using Only Pointers

Code

#include <stdio.h>

void reverse_array(int *ptr, int n) {
        int i = 0, j = n - 1;

    // Swap elements from front and back until the middle is reached
    while (i < j) {
        // Temporarily hold one element
        int temp = *(ptr + i);

        // Swap front and back
        *(ptr + i) = *(ptr + j);
        *(ptr + j) = temp;

        // Move indices towards the center
        i++;
        j--;
    }
}

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