list stl
#include <iostream>
#include<list>
#include<algorithm>
using namespace std;
int main()
{
list<int>l{10,20,30};
for(list<int>::iterator it1=l.begin();it1!=l.end();it1++)
{
cout<<*it1<<" ";
}
cout<<endl;
list<int>::iterator it=l.begin();
l.insert(it,50);
for(list<int>::iterator it1=l.begin();it1!=l.end();it1++)
{
cout<<*it1<<" ";
}
cout<<endl;
l.push_back(60);
l.push_front(100);
for(list<int>::iterator it1=l.begin();it1!=l.end();it1++)
{
cout<<*it1<<" ";
}
cout<<endl;
l.pop_back();
l.pop_front();
for(list<int>::iterator it1=l.begin();it1!=l.end();it1++)
{
cout<<*it1<<" ";
}
cout<<endl;
cout<<l.empty()<<endl;
l.reverse();
for(list<int>::iterator it1=l.begin();it1!=l.end();it1++)
{
cout<<*it1<<" ";
}
cout<<endl;
list<int>l2{100,200,300,400};
l.swap(l2);
for(list<int>::iterator it1=l.begin();it1!=l.end();it1++)
{
cout<<*it1<<" ";
}
cout<<endl;
for(list<int>::iterator it1=l2.begin();it1!=l2.end();it1++)
{
cout<<*it1<<" ";
}
cout<<endl;
l2.sort();
for(list<int>::iterator it1=l2.begin();it1!=l2.end();it1++)
{
cout<<*it1<<" ";
}
cout<<endl;
l2.sort(greater<int>());
for(list<int>::iterator it1=l2.begin();it1!=l2.end();it1++)
{
cout<<*it1<<" ";
}
cout<<endl;
cout<<"--------"<<endl;
l.sort();
l2.sort();
l.merge(l2);
for(list<int>::iterator it1=l.begin();it1!=l.end();it1++)
{
cout<<*it1<<" ";
}
cout<<endl;
cout<<endl;
return 0;
}