forked from iamAnki/CPP-Programs-
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Vector(implementation).cpp
96 lines (85 loc) · 1.57 KB
/
Vector(implementation).cpp
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
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
#include<bits/stdc++.h>
#define ll long long int
#define endl "\n"
using namespace std;
class Vector{
// Data Members
int *arr;
int cs;
int ms;
// Constructor and Destructor
public:
Vector(int max_size=1){
cs=0; // Current size
ms=max_size; // Maximum Size
arr = new int[ms]; // New array of size ms
}
void push_back(const int d){
// Two cases
if(cs==ms)
{
// Creating an old Pointer to point to the present array
int *oldArr=arr;
// Doubling the size of the array and creating the array
ms=2*ms;
arr=new int[ms];
// Copying the contents of oldArray to new one
for(int i=0;i<cs;i++){
arr[i]=oldArr[i];
}
// Deleting the old Array
delete [] oldArr;
}
// Entering data into the array
arr[cs]=d;
cs++;
}
// Deleting element from array
void pop_back(){
if(cs>=0){
cs--;
}
}
// Check if the vector is empty
bool isEmpty() const{
return cs==0;
}
// Front, Back, At(i), [] -> Operator overloading
int front() const{
return arr[0];
}
int back() const{
return arr[cs-1];
}
int size() const{
return cs;
}
int capacity() const{
return ms;
}
int at(int i){
return arr[i];
}
int operator[](const int i) const{
return arr[i];
}
};
int main()
{
Vector v(5);
v.push_back(1);
v.push_back(2);
v.push_back(3);
v.push_back(4);
v.push_back(5);
v.push_back(6);
v.pop_back();
cout<<v.size()<<endl;
cout<<v.capacity()<<endl;
cout<<v.at(3)<<endl;
// Printing all the elements present in the vector
cout<<"Contents of the array are:"<<endl;
for(int i=0;i<v.size();i++){
cout<<v[i]<<" ";
}
}