What are the different types of containers in C++ Standard Library?

What are the different types of containers in C++ Standard Library?

The C++ Standard Library provides several types of containers, including vector, list, deque, set, map, and unordered_map. Each has its own use cases and performance characteristics.

Can you explain the differences between vector and list?

Sure! A vector is a dynamic array that allows random access and is efficient for adding/removing elements at the end. A list, on the other hand, is a doubly linked list that allows efficient insertions and deletions from anywhere but does not support random access.

When should I use a set instead of a vector?

You should use a set when you need to maintain unique elements and require fast lookups, insertions, and deletions. A vector does not enforce uniqueness and is slower for these operations.

What about maps? How do they differ from sets?

Maps store key-value pairs and allow you to access values based on their keys, while sets only store unique keys without associated values. Maps are useful for associative arrays.

Can you give me an example of using a map in C++?

Certainly! Here's a simple example:

#include <iostream>
#include <map>

int main() {
    std::map<std::string, int> ageMap;
    ageMap["Alice"] = 30;
    ageMap["Bob"] = 25;
    std::cout << "Alice's age: " << ageMap["Alice"] << std::endl;
    return 0;
}