#include <stdio.h>
void reverse_array(int arr[], int n) {
// Your logic here
// Approach 1:
// int left = 0, right = n - 1;
// while (left < right) {
// int t = arr[left];
// arr[left] = arr[right];
// arr[right] = t;
// left++;
// right--;
// }
// Approach 2:
for (int i = 0; i < n/2; i++) {
int t = arr[i];
arr[i] = arr[n - i - 1];
arr[n - i - 1] = t;
}
}
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