Container

Vector

Sort

* time complexity = O(NlogN), where N is the number of elements in the vector.

sort(iter_first, iter_last)

The elements are sorted in acsending order.

int main() { vector<int> vec{ 1, 5, 8, 9, 6, 7, 3, 4, 2, 0 }; sort(vec.begin(), vec.end()); } input data: 1, 5, 8, 9, 6, 7, 3, 4, 2, 0 sorted data: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9

sort(iter_first, iter_last, comp)

compare one element int main() { vector<int> vec{ 1, 5, 8, 9, 6, 7, 3, 4, 2, 0 }; sort(v.begin(), v.end(), greater<int>()); } input data: 1, 5, 8, 9, 6, 7, 3, 4, 2, 0 sorted data: 9, 8, 7, 6, 5, 4, 3, 2, 1, 0

bool static cmp(const pair<int,int> &p1, const pair<int,int> &p2) { return p1.second < p2.second; //second element is ascending order } int main() { vector<pair<int,int>> vec = {{6,8}, {1,9}, {2,4}, {4,7}}; sort(vec.begin(), vec.end(), cmp); } input data: [[6,8], [1,9], [2,4], [4,7]] sorted data: [[2,4], [4,7], [6,8], [1,9]]

compare two element bool static cmp(vector<int> a,vector<int> b) { if(a[0] == b[0]) return a[1] < b[1]; //second element is ascending order based on the the order of the first element return a[0] > b[0]; //first element is descending order } int main() { vector<vector<int>> vec = {{7,0}, {4,4}, {7,1}, {5,0}, {6,1}, {5,2}}; sort(vec.begin(), vec.end(), cmp); } input data: [[7,0], [4,4], [7,1], [5,0], [6,1], [5,2]] sorted data: [[7,0], [7,1], [6,1], [5,0], [5,2], [4,4]]

Insert

Automatically rearrage all the postion of elements after insertion.

insert(iter_position, val)

insert single number int main() { vector<int> vec = { 1, 3, 5}; vec.insert(vec.begin()+1, 2); } vec data before insertion: [1, 3, 5] vec data after insertion: [1, 2, 3, 5]

Delete

delete any one of the element in the vector by replaceing the last element and pop_back