Learn to Code and Code to Learn
Your Journey to Code Mastery
Stacks are a type of container adaptors with LIFO(Last In First Out) type of working, Where insertion and deletion is always performed at the top of the stack. For creating a stack, we must include the <stack> header file in our code. We then use this syntax to define the std::stack: Functions of stack: empty…
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 the queue and elements are in nonincreasing order (hence we can see that each element of the queue has a priority {fixed order}). This context is similar to a heap, where…
Queues are a type of container adaptors which operate in a first in first out (FIFO) type of arrangement. Elements are inserted at the back (end) and are deleted from the front. Queue functions are: empty() – Returns whether the queue is empty. size() – Returns the size of the queue. queue::swap() in C++ STL –…
Forward_list in STL implements singly linked list. Introduced from C++11, forward list are more useful than other containers in insertion, removal and moving operations (like sort) and allows time constant insertion and removal of elements. It differs from list by the fact that forward_list keeps track of location of only next element while list keeps track to both…
Arrays are fixed-size sequence containers: they hold a specific number of elements ordered in a strict linear sequence. The introduction of array class from C++11 has offered a better alternative for C-style arrays. The advantages of array class over C-style array are :- Array classes knows its own size, whereas C-style arrays lack this property….
Double ended queues are sequence containers with the feature of expansion and contraction (fast insertion and deletion) on both the ends. Double Ended Queues are basically an implementation of the data structure double ended queue.Although we can also use vector container for the insertion and deletion at both of its ends, but insertion and deletion…
Lists are sequence containers that allow constant time insert and erase operations anywhere within the sequence, and iteration in both directions. As compared to vector, list has slow traversal, but once a position has been found, insertion and deletion are quick. List containers are implemented as doubly-linked lists For implementing a singly linked list, we…
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 automatically by the container. Vector elements are placed in contiguous storage so that they can be accessed and traversed using iterators. In vectors: data is inserted at the end. Inserting…
C++ STL (Standard Template Library) is a powerful set of C++ template classes to provide general-purpose classes and functions with templates that implement many popular and commonly used algorithms and data structures like vectors, lists, queues, and stacks.It is a library of container classes, algorithms, and iterators. STL has four components Containers Iterators Algorithms Functions…
Class Templates Like function templates, you can also create class templates for generic class operations. When a class uses the concept of Template, then the class is known as generic class. Sometimes, you need a class implementation that is same for all classes, only the data types used are different. Syntax of Class Template In…