#include <stdio.h> void reverse_array(int *ptr, int n) { if( n <= 0) return; // Your logic here int *start = ptr; int *end = &ptr[n-1]; while(n>1){ *start += *end; *end = *start - *end; *start = *start - *end; n -= 2; start++; end--; } } 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