C++ Program To Reverse An Array In O(n) Complexity

Problem :- Write A C++ Program To Reverse An Array In O(n);

ARRAY :- Array act to store related data under a single variable name with an index, also known as a subscript. It is easiest to think of an array as simply a list or ordered grouping for variables of the same type. As such, arrays often help a programmer organize collections of data efficiently and intuitively.

Solution :-

#include<iostream>

using namespace std;

int main()

{

  int *a;

  int i,j,temp;

  int n;

  cout<<"Enter The Size of Array \n";

  cin>>n;

  a=new int[n];

  int l=0,h=n-1;

 

cout<<"Enter The Elements of Array \n";

  for(i=0;i<n;i++)

  cin>>a[i];

  while(l<h)

  {

  temp=a[l];

  a[l]=a[h];

  a[h]=temp;

  l++;

  h--;

  }

 

cout<<"\nReverse Array Is\n";

  for(i=0;i<n;i++)

  {

  cout<<a[i]<<" ";

    }

   return 0;

}

Output :-