#include <stdio.h> void reverse_array(int *ptr, int n) { int m = (n/2)-1; //printf("m=%d\n",m); for(int x = 0 ; x <= m ; x++) { int tmp = *(ptr+x); *(ptr+x) = *(ptr+n-1-x); *(ptr+n-1-x) = tmp; //printf("[%d,%d] ",a,b); } } 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; }
Test Cases
Test Results
Input
5 1 2 3 4 5
Expected Output
5 4 3 2 1