#include <stdio.h> void reverse_array(int arr[], int n) { // Your logic here int temp=0; int div=n/2; if (n%2==0) { div-=1; } for (int i =0; i<=(div);i++) { temp=arr[i]; arr[i]=arr[n-i-1]; arr[n-i-1]=temp; // printf("%d %d %d\n",temp,arr[i],arr[n-i]); // printf("%d %d %d\n",temp,arr[i],arr[n-i]); // printf("%d %d %d\n",temp,arr[i],arr[n-i]); } // return arr; } 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