#include<iostream>
using namespace std;
int main()
{
int a[]={1,2,3,4,5}; // Using Pointer and Array Relationship
for (int i = 4; i>=0; i--)
cout<<*(a+i);
return 0;
}
// C++ program to reverse Array
// using reverse() in STL
#include <algorithm>
#include <iostream>
using namespace std;
int main()
{
// Get the array
int arr[] = { 1, 45, 54, 71, 76, 12 };
// Compute the sizes
int n = sizeof(arr) / sizeof(arr[0]);
// Print the array
cout << "Array: ";
for (int i = 0; i < n; i++)
cout << arr[i] << " ";
// Reverse the array
reverse(arr, arr + n);
// Print the reversed array
cout << "
Reversed Array: ";
for (int i = 0; i < n; i++)
cout << arr[i] << " ";
return 0;
}
//Reverse an array using C++ STL
#include <algorithm> //Header file for reverse method
int arr[] = { 1, 2, 3, 4, 5 };
int n = sizeof(arr) / sizeof(arr[0]); //Size of array
reverse(arr, arr + n);
//Now array looks like = { 5, 4, 3, 2, 1 }
//The time complexity is O(n)
//https://www.linkedin.com/in/kalyan-santra-44589a126/