C++: Working with Associative Containers & Algorithms

Associative containers provide fast lookup in O(log n) time by associating each entry with a key. Sets and maps are both associative containers. Algorithms are classes that support container-agnostic operations performed on containers. In this course learn how to create sets and iterate over them as well as use ordered and unordered multisets. Next practice creating maps and indexing into them using keys as well as inserting key-value pairs into maps. Finally examine how random access of elements is faster with unordered maps compared to ordered maps and explore various STL algorithms. Upon completion youll be able to differentiate between sequence and associative containers leverage STL algorithms and instantiate and use sets multisets maps and multimaps.