C++ Program To Print Number Without Reassigning

Internal Data Structures and Time Complexity Table of All the C++ STL Containers

Last Updated : 24 Jul, 2024

As we all are using STL quite heavily in our programs in Interviews, Coding Contests. So knowing the Time complexity of the most frequently used operation and the data structure used behind the scene (in the internal implementation of the STL Library) is a must to know information.

C++ STL Containers with Time Complexity & Data Structure used Behind the Scene:

S. No.	STL Container Name	Internal Data-Structure	Time Complexity
1.	Unordered Set	Hash Table (A hash table uses a hash function to compute an index)	For Insert, Search, Delete: Best: O(1) Avg: O(1) Worst: O(N)
2.	Set	Red Black Tree (self-balancing binary search tree – maintains the height of tree log N)	For Insert, Search, Delete: Best: O(log N) Avg: O(log N) Worst: O(log N)
3.	MultiSet [Set that stores duplicate elements also]	Threaded Red Black Tree (self-balancing binary search tree – maintains the height of tree log N)	For Insert, Search, Delete: Best: O(log N) Avg: O(log N) Worst: O(log N)
4.	Unordered Map	Hash Table (A hash table uses a hash function to compute an index)	For Insert, Search, Delete: Best: O(1) Avg: O(1) Worst: O(N)
5.	Map	Red Black Tree (self-balancing binary search tree – maintains the height of tree log N)	For Insert, Search, Delete: Best: O(log N) Avg: O(log N) Worst: O(log N)
6.	MultiMap [Map that stores duplicate keys also]	Threaded Red Black Tree (self-balancing binary search tree – maintains the height of tree log N)	For Insert, Search, Delete: Best: O(log N) Avg: O(log N) Worst: O(log N)
7.	Priority_queue	Max Heap	Insert/Push: O(log N) Delete/Pop: O(log N) Peek/Top: O(1)
8.	Stack	Linked List	Push: O(1) Pop: O(1) Top: O(1)
9.	Queue	Linked List	Push: O(1) Pop: O(1) Front: O(1) Back: O(1)

This is a kind of look-up table to know the Time Complexity of each operation, the short reason can be quickly interpreted from the Data Structure used to internally implement the container in C++ STL.

Also from the Time Complexities of each operation, we can easily calculate the Time Complexity of the entire program.

C++ Program To Print Number Without Reassigning

rbkraj000

Improve

Article Tags :

Practice Tags :

Similar Reads

Analysis of time and space complexity of C++ STL containers

In this article, we will discuss the time and space complexity of some C++ STL classes. Characteristics of C++ STL: C++ has a low execution time as compared to other programming languages.This makes STL in C++ advantageous and powerful.The thing that makes STL powerful is that it contains a vast var

Time complexities of different data structures

Time Complexity is a concept in computer science that deals with the quantification of the amount of time taken by a set of code or algorithm to process or run as a function of the amount of input. In other words, the time complexity is how long a program takes to process a given input. The efficien

What are the Complexity Guarantees of the Standard Containers?

In C++, the Standard Template Library (STL) provides various containers such as std::vector, std::list, std::map, and others, each designed for specific use cases. A very important aspect when we choose the right container for our application is to understand the complexity guarantees they offer for

How to Determine if a Type is an STL Container at Compile Time?

In C++, Standard Template Library (STL) provides many containers such as std::vector, std::list, std::map, and more. What if we want to write a generic code that behaves differently when a given type is an STL container? To do this we need to determine at compile time whether a given type is an STL

Complete Guide On Complexity Analysis - Data Structure and Algorithms Tutorial

Complexity analysis is defined as a technique to characterise the time taken by an algorithm with respect to input size (independent from the machine, language and compiler). It is used for evaluating the variations of execution time on different algorithms. What is the need for Complexity Analysis?

Why does the C++ STL not provide any "tree" containers?

What is STL in C++? The Standard Template Library (STL) is a set of C++ template classes to provide common programming data structures and functions. It is a library of container classes, algorithms, functions and iterators. It is a generalized library and so, its components are parameterized. Worki

Time and Space complexity of 1-D and 2-D Array Operations

The time and space complexity of one-dimensional and two-dimensional array operations can vary depending on the specific operation. Here, we'll discuss common array operations and provide insights into their time and space complexities for one-dimensional and two-dimensional arrays. One-Dimensional

Array of Structures vs Array within a Structure in C++

In C++, an array of structure and an array within structure are used frequently used for data storage. Although they sound similar, they work pretty differently from each other. In this article, we will discuss the key differences between an array of structures and an array within structures and cla

Where to Use a Particular STL Container?

The Standard Template Library (STL) in C++ has a variety of containers designed to store collections of data. Each container has unique characteristics and is optimized for different operations. One common question that arises is which STL container to use in a specific scenario. In this article, we

Why C++ Containers Don't Allow Incomplete Types?

C++ Standard Template Library (STL) provides various containers such as std::vector, std::list, std::map, and more. These containers are essential for managing collections of objects efficiently. However, we might encounter an issue when trying to use incomplete types with these containers. In this