Reverse an Array Using Only Pointers

Code

#include <stdio.h>

void reverse_array(int *ptr, int n) {
    // Your logic here
    int *end = ptr+n-1;
    while(ptr<end)
    {
        int temp = *ptr;
        *ptr = *end;
        *end = temp;
        ptr++;
        end--;
    }
}

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

🔁 Reverse Array Using Pointers – Approach

1. Initialize two pointers:
   start → beginning of array
   end → end of array (start + n - 1)
2. Swap values at start and end using *start and *end.
3. Move pointers inward:
   start++, end-- until they meet.
4. Print using pointer arithmetic:
   *(arr + i) instead of arr[i].