feat: implementation of linear search

include/AlgoCpp/algorithms/search/linearSearch.hpp

@@ -0,0 +1,16 @@
+#pragma once
+
+namespace algocpp {
+namespace search {
+
+template <typename T, typename Z>
+bool linearSearch(T& input, Z item) {
+    for (auto it = input.begin(); it != input.end(); ++it) {
+        if (*it == item) {
+            return true;
+        }
+    }
+    return false;
+}
+} // namespace search
+} // namespace algocpp

include/AlgoCpp/algorithms/sorting/bubbleSort.hpp

@@ -1,7 +1,6 @@
 #pragma once
 
-#include <iostream>
-#include <vector>
+#include <algorithm>
 
 namespace algocpp {
 namespace sorting {

tests/CMakeLists.txt

@@ -10,6 +10,7 @@ add_executable(
 	${PROJECT_NAME}
 	"main.cpp"
 	"sorting/bubbleSort.cpp"
+	"search/linearSearch.cpp"
 	${BenchmarkFiles}
 
 )

tests/search/linearSearch.cpp

@@ -0,0 +1,21 @@
+#define CATCH_CONFIG_ENABLE_BENCHMARKING
+#include "AlgoCpp/algorithms/search/linearSearch.hpp"
+#include <array>
+#include <catch2/catch.hpp>
+#include <iostream>
+#include <vector>
+
+using namespace algocpp::search;
+
+TEST_CASE("Check if linear search is working", "[linearSearch]") {
+    std::vector<int> test1 = {1, 4, 5, 2, 3};
+    std::vector<int> test2 = {1};
+    std::vector<char> test3 = {'c', 'b', 'x', 'm', 'n'};
+
+    REQUIRE(linearSearch(test1, 5) == true);
+    REQUIRE(linearSearch(test1, 7) == false);
+    REQUIRE(linearSearch(test2, 1) == true);
+    REQUIRE(linearSearch(test2, 5) == false);
+    REQUIRE(linearSearch(test3, 'b') == true);
+    REQUIRE(linearSearch(test3, 'A') == false);
+}