Reverse an Array Using Only Pointers

Code

#include <stdio.h>

void reverse_array(int *ptr, int n) {
    // Your logic here
    // int tg;
    // for(int i=0; i<n/2; i++){
    //     tg = *(ptr+i);
    //     *(ptr+i)=*(ptr+(n-1-i));
    //     *(ptr+(n-1-i)) = tg;
    // }
    int *left, *right, tg;
    left = ptr;
    right = (ptr + (n - 1));
    while(left < right){
        tg = *left;
        *(left) = *(right);
        *(right) = tg;
        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