Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- int main(){
- vector<int> v;
- v.push_back(35);
- v.push_back(45);
- v.push_back(55); // 35,45,55
- v.insert(v.begin(),30); //30,35,45,55
- v.insert(v.begin()+2, 40);
- for(int i =0; i<v.size(); i++){
- cout<<v[i]<<" ";
- }
- cout<<endl;
- //30,35,40,45,55
- v.erase(v.begin()+2);
- for(int i =0; i<v.size(); i++){
- cout<<v[i]<<" ";
- }
- cout<<endl;
- // 30, 35,45,55
- v.erase(v.begin(),v.begin()+2);
- for(int i =0; i<v.size(); i++){
- cout<<v[i]<<" ";
- }
- cout<<endl;
- //45,55
- //v.end() gives the address of last element + 1
- v.erase(v.begin(),v.end());
- cout<<"size of vector is now = "<<v.size()<<endl;
- cout<<"----------First part of the lec is done---------"<<endl;
- vector<int> vec;
- vec.push_back(7);
- vec.push_back(3);
- vec.push_back(8);
- vec.push_back(1); // 7,3,8,1
- for(int i = 0;i<vec.size();i++){
- cout<<vec[i]<<" ";
- }
- cout<<endl;
- sort(vec.begin(),vec.end());
- cout<<"After sorting : "<<endl;
- for(int i = 0;i<vec.size();i++){
- cout<<vec[i]<<" ";
- }
- cout<<endl;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement