#include <stdio.h>
void reverse_array(int *ptr, int n) {
// Your logic here
int copy_num;
int s_idx = 0, e_idx = n-1;
while(s_idx != e_idx)
{
copy_num = *(ptr + s_idx);
*(ptr + s_idx) = *(ptr + e_idx);
*(ptr + e_idx) = copy_num;
if(n %2 == 0 && (e_idx - s_idx) == 1)
{
return;
}
e_idx--;
s_idx++;
}
}
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;
}
Input
5 1 2 3 4 5
Expected Output
5 4 3 2 1