C++: Working with Associative Containers & Algorithms
C++
| Expert
- 11 videos | 1h 21m 34s
- Includes Assessment
- Earns a Badge
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, you'll be able to differentiate between sequence and associative containers, leverage STL algorithms, and instantiate and use sets, multisets, maps, and multimaps.
WHAT YOU WILL LEARN
-
Discover the key concepts covered in this courseRecognize associative containers and their usesMake and use unordered regular setsUse unordered sets and multisetsCreate and iterate over map data structuresUtilize unordered maps and contrast them with ordered maps
-
Create ordered and unordered multimapsOrder the objects stored in setsUse built-in and custom algorithms on setsPerform advanced algorithms and transformationsSummarize the key concepts covered in this course
IN THIS COURSE
-
1m 50s
-
3m 28s
-
7m 40s
-
7m 28s
-
9m 3s
-
7m 42s
-
10m 27s
-
9m 25s
-
9m 16s
-
11m 40s
-
3m 35s
EARN A DIGITAL BADGE WHEN YOU COMPLETE THIS COURSE
Skillsoft is providing you the opportunity to earn a digital badge upon successful completion on some of our courses, which can be shared on any social network or business platform.
Digital badges are yours to keep, forever.