All submissions

Reverse an Array In-Place

Code

#include <stdio.h>
#define SWAP(A, B) ((A) ^= (B) ^= (A) ^= (B))

void reverse_array(int arr[], int n) {
    for (int i = 0; i < n / 2; i++) {
        SWAP(arr[i], arr[n - 1 - i]);
    }
}

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

 

 

 

Loading...

Input

5 1 2 3 4 5

Expected Output

5 4 3 2 1