Skip to content

Tag Archives: CPP-Library

Priority queues are a type of container adaptors, specifically designed such that the first element of the queue is either the greatest or the smallest… Read More
Priority queues are a type of container adaptors, specifically designed such that the first element of the queue is either the greatest or the smallest… Read More
Priority queues are a type of container adaptors, specifically designed such that the first element of the queue is either the greatest or the smallest… Read More
The exp() function in C++ returns the exponential (Euler’s number) e (or 2.71828) raised to the given argument. Syntax for returning exponential e: result=exp() Parameter:… Read More
Log() function in C++ : The log() function in C++ returns the natural logarithm (base-e logarithm) of the argument passed in the parameter.   Syntax… Read More
Queue are a type of container adaptors which operate in a first in first out (FIFO) type of arrangement. Elements are inserted at the back… Read More
Forward list in STL implements singly linked list. Introduced from C++11, forward list are useful than other containers in insertion, removal and moving operations (like… Read More
Forward list in STL implements singly linked list. The forward list was introduced in C++11,  and is useful than other containers in insertion, removal, and… Read More
Forward list in STL implements singly linked list. Introduced from C++11, forward list are useful than other containers in insertion, removal and moving operations (like… Read More
Stacks are a type of container adaptors that follow LIFO(Last In First Out) property, where a new element is added at one end and an… Read More
Stacks are a type of container adaptors with LIFO(Last In First Out) type of work, where a new element is added at one end called… 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
Deque or Double Ended queues are sequence containers with the feature of expansion and contraction on both ends. They are similar to vectors, but are… Read More
Deque or Double Ended queues are sequence containers with the feature of expansion and contraction on both ends. They are similar to vectors, but are… Read More
Deque or Double ended queues are sequence containers with the feature of expansion and contraction on both the ends. They are similar to vectors, but… Read More

Start Your Coding Journey Now!