Reverse an Array Using Only Pointers

Code

#include <stdio.h>

void reverse_array(int *ptr, int n) {
    // Set the left ptr to the beginning of array
    int *left_ptr = ptr;
    // Set the right pointer to the end of array
    int *right_ptr = ptr+(n-1);
    // While left ptr is less than right ptr
    while(left_ptr < right_ptr){
        // set tmp var
        int tmp = *left_ptr;
        // swap values
        *left_ptr = *right_ptr;
        *right_ptr = tmp;
        // increment ptrs
        *left_ptr++;
        *right_ptr--;
    }
}

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