#include <stdio.h> void reverse_array(int *ptr, int n) { // Your logic here int tmp_val = 0; int *tmp = ptr; for (int i = 0; i < (int)(n/2); i++){ tmp_val = *tmp; *tmp = *(tmp+(n-1-(2*i))); *(tmp+(n-1-(2*i))) = tmp_val; tmp++; } //for (int k = 0; k < n; k++) // printf("%d ",*(ptr + k)); } 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