#include<iostream>
#include<list>
using namespace std;
void disp(list<int> &lst)
{
list<int>::iterator p;
for(p=lst.begin();p!=lst.end();++p)
{
cout<<"\n"<<*p;
}
}
void main()
{
cout<<"\t\t\t\tConatinersAndIterators";
list<int>list1;
list<int>list2;
int x,y,n,m;
cout<<"\n Enter the range";
cin>>n;
cout<<"\n Enter" <<n<<" Integer values";
for(int i=0;i<n;i++)
{
cin>>x;
list1.push_back(x);
}
cout<<"\n Enter the range";
cin>>m;
cout<<"\n Enter" <<m<<" Integer values";
for( i=0;i<m;i++)
{
cin>>y;
list2.push_back(y);
}
cout<<"\n List1";
disp(list1);
cout<<"\n List2";
disp(list2);
list1.push_front(100);
list1.push_back(200);
list2.pop_front();
cout<<"\n New List1";
disp(list1);
cout<<"\n New List2";
disp(list2);
list<int>listA,listB;
listA=list1;
listB=list2;
listA.sort();
listB.sort();
listA.merge(listB);
cout<<"\n Sorted Merge List";
disp(listA);
listA.reverse();
cout<<"\n Reversed List";
disp(listA);
}
Comments
Post a Comment