test_demo/vector.cpp at main · dhan2001verma/test_demo · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
 #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{ vector <int> *vp=new vector<int>();
  vector <int> v;

  vector <int> v2(10,-2);
  vector <int> v3(100);
  for(int i=0;i<v2.size();i++)
  {cout<<v2[i]<<endl;
	}

  sort(v2.begin(),v2.end());
  /*for(int i=0;i<100;i++)
  {
   cout<<"capacity"<<v.capacity()<<endl;
   cout<<"size "<<v.size()<<endl;
   v.push_back(i+1);
  }*/
  /*for(int i=0;i<v.size();i++)
  {cout<<v[i]<<endl;
  }*/
 /* v.push_back(10);
  v.push_back(20);
  v.push_back(30);


  v[1]=300;
  //never use []to enter the element
  //v[4]=64;
  //v[5]=348;

  v.push_back(98);
  v.push_back(288);
  for(int i=0;i<v.size();i++)
  {cout<<v[i]<<endl;
  }
  //cout<<v.at(4)<<endl;//at()check the index
  //cout<<v.at(6)<<endl;
  //cout<<v[0]<<endl;
  //cout<<v[1]<<endl;
  //cout<<v[2]<<endl;
  //cout<<v[3]<<endl;
  //cout<<v[4]<<endl;
  //cout<<v[5]<<endl;
  //cout<<v[6]<<endl;*/

 return 0;


}