Address Visited Program – Algorithms & Data Structures in C++

#include<iostream>
using namespace std;

int main(){ int j=0;
int temp=0;
int temp1=0;
int arr[5]={1,2,3,4,5};

for(int i=0;i<5;i++){ cout<<“Value=”<<arr[i]<<” Home address “<<&arr[i];
cout<<endl;}

for(j=1;j<6;j++){

if(j==1){
temp1=arr[0];
for(int i=0;i<5;i++){

temp=arr[i];
if(i!=4){

arr[i]=arr[i+1];}

if(i==4){
arr[4]=temp1;
}
}
for(int i=0;i<5;i++){ cout<<“Value=”<<arr[0]<<” address visited “<<&arr[i];
cout<<endl;}
cout<<endl;
for(int i=0;i<5;i++){ cout<<“Value=”<<arr[1]<<” address visited “<<&arr[i];
cout<<endl;}
cout<<endl;
for(int i=0;i<5;i++){ cout<<“Value=”<<arr[2]<<” address visited “<<&arr[i];
cout<<endl;}
cout<<endl;
for(int i=0;i<5;i++){ cout<<“Value=”<<arr[3]<<” address visited “<<&arr[i];
cout<<endl;}
cout<<endl;
for(int i=0;i<5;i++){ cout<<“Value=”<<arr[4]<<” address visited “<<&arr[i];
cout<<endl;}
cout<<endl;

}}
return 0;
}