C++: Working with Associative Containers & Algorithms

C++    |    Expert
  • 11 videos | 1h 21m 34s
  • Includes Assessment
  • Earns a Badge
Rating 4.4 of 5 users Rating 4.4 of 5 users (5)
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 course
    Recognize associative containers and their uses
    Make and use unordered regular sets
    Use unordered sets and multisets
    Create and iterate over map data structures
    Utilize unordered maps and contrast them with ordered maps
  • Create ordered and unordered multimaps
    Order the objects stored in sets
    Use built-in and custom algorithms on sets
    Perform advanced algorithms and transformations
    Summarize the key concepts covered in this course

IN THIS COURSE

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.

PEOPLE WHO VIEWED THIS ALSO VIEWED THESE

Rating 4.4 of 14 users Rating 4.4 of 14 users (14)
Rating 4.1 of 9 users Rating 4.1 of 9 users (9)
Rating 4.7 of 201 users Rating 4.7 of 201 users (201)