Reverse an Array Using Only Pointers

Code

#include <stdio.h>

void reverse(int *left, int *right){
    if(left == NULL || right == NULL){
        return;
    }
    while(left < right){
        *left ^= *right;
        *right ^= *left;
        *left ^= *right;
        left++;
        right--;
    }
}

void reverse_array(int *ptr, int n) {
    // Your logic here
    if(ptr == NULL || n <= 0){
        return;
    }
    reverse(&ptr[0], &ptr[n - 1]);
    
}

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