What are the different types of STL containers in C++?

What are the different types of STL containers in C++?

In C++, the Standard Template Library (STL) provides several types of containers, including:

1. Vector: A dynamic array that can resize itself.
2. List: A doubly linked list that allows for efficient insertions and deletions.
3. Deque: A double-ended queue that allows fast insertions and deletions at both ends.
4. Set: A collection of unique elements, sorted by default.
5. Map: A collection of key-value pairs, where keys are unique.
6. Unordered Set: A collection of unique elements without a specific order.
7. Unordered Map: A collection of key-value pairs without a specific order.

Would you like to know more about any specific container?

Can you explain how a vector works?

Sure! A vector in C++ is a dynamic array that can grow and shrink in size. It allows random access to elements, meaning you can access any element in constant time using its index. Vectors manage their own memory, automatically allocating more space as needed when you add elements. You can add elements using the push_back() method and remove them with pop_back(). Vectors also support various operations like sorting and searching. Would you like to see some code examples?

Yes, please provide a code example of using a vector.

Here's a simple example of using a vector in C++:

#include <iostream>
#include <vector>

int main() {
    std::vector<int> numbers;
    // Adding elements to the vector
    numbers.push_back(10);
    numbers.push_back(20);
    numbers.push_back(30);

    // Accessing elements
    std::cout << "First element: " << numbers[0] << std::endl;

    // Iterating through the vector
    for (int num : numbers) {
        std::cout << num << " ";
    }
    return 0;
}

This code creates a vector of integers, adds three numbers, and then prints them. Let me know if you have any questions!