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.
sort(iter_first, iter_last, comp)
compare one element
compare two element
Insert
Automatically rearrage all the postion of elements after insertion.
insert(iter_position, val)
insert single number
Delete
delete any one of the element in the vector by replaceing the last element and pop_back