Tutorialspoint.dev
Welcome To Tutorialspoint.dev
Officially launched 18th May 2019
C C-Library C

isgraph() C library function

The C library function isgraph() checks whether a character is a graphic character or not. Characters that have graphical representation are known are graphic charac...
C CPP-Library cpp-math

C Library math.h functions

The math.h header defines various mathematical functions and one macro. All the functions available in this library take double as an argument and return double as th...
C++ STL STL

The C++ Standard Template Library (STL)

The Standard Template Library (STL) is a set of C++ template classes to provide common programming data structures and functions such as lists, stacks, arrays, etc. I...
C++ cpp-algorithm-library STL

Sort in C++ Standard Template Library (STL)

Sorting is one of the most basic functions applied to data. It means arranging the data in a particular fashion, which can be increasing or decreasing. There is a bui...
C++ Binary Search cpp-algorithm-library

Binary Search in C++ Standard Template Library (STL)

Binary search is a widely used searching algorithm that requires the array to be sorted before search is applied. The main idea behind this algorithm is to keep divid...
C++ cpp-containers-library cpp-pair

Pair in C++ Standard Template Library (STL)

The pair container is a simple container defined in <utility> header consisting of two data elements or objects. The first element is referenced as ‘fi...
C++ cpp-containers-library cpp-list

List in C++ Standard Template Library (STL)

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, inserti...
C++ cpp-containers-library cpp-deque

Deque in C++ Standard Template Library (STL)

Double ended queues are sequence containers with the feature of expansion and contraction on both the ends. They are similar to vectors, but are more efficient in cas...
C++ cpp-containers-library cpp-queue

Queue in Standard Template Library (STL)

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...
C++ cpp-containers-library cpp-priority-queue

Priority Queue in C++ Standard Template Library (STL)

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 elem...

Subscribe to Our Newsletter