Reverse an Array Using Only Pointers

Code

#include <stdio.h>
/*
Reverse array using pointers
Whatever is at the end comes to the begining
use two pointers
start and end
start = *ptr
end = *ptr + n
while(start < end)
swap the start and end
increment start and decrement the end ptr


*/



void reverse_array(int *ptr, int n) {
    // Your logic here
    int *startPtr = ptr;
    int *endPtr = ptr + n - 1;

    while(startPtr < endPtr)
    {
        int tmp = *startPtr;
        *startPtr = *endPtr;
        *endPtr = tmp;
        startPtr++;
        endPtr--;
    }
}

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