C++11 Container Tutorials

Can you explain the differences between std::vector and std::list in C++11?

Sure! std::vector is a dynamic array that allows random access and is efficient for adding/removing elements at the end. std::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 std::deque instead of std::vector?

Use std::deque when you need efficient insertions and deletions at both ends of the container. std::vector is better for random access and when you mostly add/remove elements at the end.

What are the advantages of using std::unordered_map?

std::unordered_map offers average constant time complexity for lookups, insertions, and deletions, making it faster than std::map for most use cases. However, it does not maintain order.

Can you give me an example of using std::set?

Certainly! Here's a simple example:

#include <set>
#include <iostream>

int main() {
    std::set<int> mySet = {1, 2, 3, 4};
    mySet.insert(5);
    for (int num : mySet) {
        std::cout << num << " ";
    }
}

This will output: 1 2 3 4 5.