Summary  
This chapter covers how to represent vectors and implement fundamental vector operations—addition, scalar multiplication, dot and cross products, and normalization—to perform calculations on multidimensional numeric data.

General domain of usage  
Physics simulations

#define CATCH_CONFIG_MAIN
#include <catch2/catch.hpp>
#include <vector>

int sumVector(const std::vector<int>& vec);
std::vector<int> createSequence(int n);

TEST_CASE("createSequence returns correct sequence for n=5", "[createSequence]") {
    std::vector<int> expected = {1, 2, 3, 4, 5};
    REQUIRE(createSequence(5) == expected);
}

TEST_CASE("createSequence returns empty vector for n=0", "[createSequence]") {
    REQUIRE(createSequence(0).empty());
}

TEST_CASE("sumVector returns correct sum for sequence 1 to 5", "[sumVector]") {
    std::vector<int> v = {1, 2, 3, 4, 5};
    REQUIRE(sumVector(v) == 15);
}

TEST_CASE("sumVector returns 0 for empty vector", "[sumVector]") {
    std::vector<int> v;
    REQUIRE(sumVector(v) == 0);
}

TEST_CASE("Integration: sumVector(createSequence(100)) == 5050", "[integration]") {
    REQUIRE(sumVector(createSequence(100)) == 5050);
}

test.cpp

Master modern C++ through the power of the Standard Template Library. Learn how containers, iterators, and algorithms work together to create clean, efficient, and expressive code. Explore essential containers like vector, map, and unordered_map, understand their performance trade-offs, and apply core algorithms for searching, sorting, transforming, and generating data. Build a solid foundation for writing robust, reusable, and high-performance C++ programs.

Overview of the STL, its design philosophy, and how containers and algorithms interact to provide powerful abstractions in C++.

Deep dive into the most important STL containers, their strengths, weaknesses, and advanced usage patterns.

Master the use of STL algorithms, from basic to advanced, and learn how to leverage them for expressive and efficient code.

Challenge: Vector Operations in Practice

解答