filmov
tv
map vs unordered map In C++
Показать описание
JOIN ME:
Time Lines
=========
0:05 Introduction
0:20 map VS unordered_map
In this video we will learn what is the basic difference between STL map and unordered_map in C++. They both belongs to standard template library (STL) and both are containers and store values in key value pair but there are so many difference when it comes to choose one over another one.
The map store data in order, it can be any order like ascending or descending that we can choose when map is instantiated, where as unordered_map has no order for storing data.
Map uses red-black tree to store data in it, where as unordered_map uses hash table to store the data.
Map has log(n) complexity to search data but as unordered_map uses hash it's complexity is way better than map and that is O(1) in average case but in worst case it can go upto O(n), but this is so rare case.
Map has same log(n) complexity for insertion and deletion and similarly for unordered_map it is O(1) on average and O(n) in worst case.
So the bottom line of the comparison is that if we need order to be maintained then map should be used otherwise if just the key value pair is required then unordered_map is sufficient and very fast also.
Do let me know if there is any further doubt in the video, i will definitely replay and try to solve all the doubts.
Thanks,
CppNuts
#mapvsunordered_map #std::map #std::unordered_map #stl #standardtemplatelibrary
Time Lines
=========
0:05 Introduction
0:20 map VS unordered_map
In this video we will learn what is the basic difference between STL map and unordered_map in C++. They both belongs to standard template library (STL) and both are containers and store values in key value pair but there are so many difference when it comes to choose one over another one.
The map store data in order, it can be any order like ascending or descending that we can choose when map is instantiated, where as unordered_map has no order for storing data.
Map uses red-black tree to store data in it, where as unordered_map uses hash table to store the data.
Map has log(n) complexity to search data but as unordered_map uses hash it's complexity is way better than map and that is O(1) in average case but in worst case it can go upto O(n), but this is so rare case.
Map has same log(n) complexity for insertion and deletion and similarly for unordered_map it is O(1) on average and O(n) in worst case.
So the bottom line of the comparison is that if we need order to be maintained then map should be used otherwise if just the key value pair is required then unordered_map is sufficient and very fast also.
Do let me know if there is any further doubt in the video, i will definitely replay and try to solve all the doubts.
Thanks,
CppNuts
#mapvsunordered_map #std::map #std::unordered_map #stl #standardtemplatelibrary
0:07:40
map vs unordered map In C++
0:30:00
Maps in C++ (std::map and std::unordered_map)
0:06:32
MAP VS UNORDERED MAP | EXCEPTIONAL CASE | WHEN TO USE AND NOT TO USE?.
0:13:09
What are maps? | Ordered and unordered maps | STL | Basics of C++ | Ep-32
0:00:27
map vs unordered_map in C++ | STL Tutorials
0:01:36
How do dictionaries (hashmaps) actually work?
0:11:05
Unordered Map and Hashing | Competitive Programming 101
0:00:21
C++ STL Battle: Map or Unordered Map for Speed?
0:05:45
Use Maps more and Objects less
0:04:35
C++ Crash Course: Ordered Maps
0:00:19
C++ Map
0:01:01
Map Solution AC but Unordered Map TLE? map v/s unordered map!
0:13:51
A Guide to Maps
0:06:53
C++ Crash Course: Unordered Maps
0:08:51
std::map vs std::unordered_map | Competitive programming PART - III
0:01:17
C++ : map vs unordered_map for few elements
0:22:20
map vs unordered map In C++||For Beginners ||Important concept of map and unordered map
0:19:31
Map in c++ STL | Unordered map and multimap explained | C++ STL tutorial - 6
0:15:56
map and unordered map clear understanding c++
0:18:24
Map in C++ with practical examples - step by step Data Structures tutorial
0:01:33
C++ : Unordered map vs vector
0:06:38
STL C++ | MAP v/s Unordered_MAP | when to choose what
0:10:32
Unordered Map
0:16:57
unorderedmap in C++ . How to insert key-value pairs into the map, and check for key in unorderedmap?
Комментарии