In this article we will discuss different ways to find or search a given element in the list.
In this article we will discuss different ways to initialize a vector in C++.
In this example we will discuss std::unique STL Algorithm.
In this article we will discuss different ways to initialize a std::vector in C++.
In this article we will see how to use std::generate and std::generate_n with STL sequential containers.
Many times we encounter a situation where we need to delete a pointer but we are not sure that how this pointer is created i.e. either on Heap or on stack.
In this article we will discuss the differences between vector and deque STL Containers.
In this article we will discuss what is a deque and how it works internally.
In this article we will discuss the iterator invalidation with respect to std::vector in C++. What is Iterator Invalidation? An Iterator becomes invalidate when the container it points to changes its shape internally i.e. move elements from one location to another and the initial iterator still points to old invalid location. Iterator invalidation in vector …
We can use vector efficiently by taking care of following points,