Summary  
This chapter introduces using Markdown syntax to structure and format text for clear documentation.

General domain of usage  
Documentation and technical writing


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

int findIndex(const std::vector<int>& vec, int value);

TEST_CASE("findIndex returns correct index when value is present", "[findIndex]") {
    std::vector<int> v = {5, 7, 9, 11};
    REQUIRE(findIndex(v, 5) == 0);
    REQUIRE(findIndex(v, 7) == 1);
    REQUIRE(findIndex(v, 11) == 3);
}

TEST_CASE("findIndex returns -1 when value is not present", "[findIndex]") {
    std::vector<int> v = {2, 4, 6};
    REQUIRE(findIndex(v, 1) == -1);
    REQUIRE(findIndex(v, 5) == -1);
}

TEST_CASE("findIndex works with empty vector", "[findIndex]") {
    std::vector<int> v;
    REQUIRE(findIndex(v, 42) == -1);
}

TEST_CASE("findIndex works with multiple occurrences (returns first index)", "[findIndex]") {
    std::vector<int> v = {3, 7, 3, 7, 3};
    REQUIRE(findIndex(v, 7) == 1);
    REQUIRE(findIndex(v, 3) == 0);
}

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: Find Element Index

Ratkaisu

Challenge: Find Element Index

Ratkaisu