Skip to content

Tag Archives: cpp-containers-library

Priority queues are a type of container adapters, specifically designed such that the first element of the queue is the greatest of all elements in… Read More
Stacks are a type of container adaptors with LIFO(Last In First Out) type of working, where a new element is added at one end and… Read More
Lists are sequence containers that allow non-contiguous memory allocation. As compared to vector, list has slow traversal, but once a position has been found, insertion… Read More
Vectors are same as dynamic arrays with the ability to resize itself automatically when an element is inserted or deleted, with their storage being handled… Read More
  Sets are a type of associative containers in which each element has to be unique, because the value of the element identifies it. The… Read More
Multisets are a type of associative containers similar to set, with an exception that multiple elements can have same values.Some Basic Functions associated with multiset: begin()… Read More
Maps are associative containers that store elements in a mapped fashion. Each element has a key value and a mapped value. No two mapped values… Read More
Multimap is similar to map with an addition that multiple elements can have same keys. Also, it is NOT required that the key value and… Read More