Organized files better for advanced algorithms

spirosmaggioros · Nov 4, 2024 · 2d94a21 · 2d94a21
1 parent 76e89a2
commit 2d94a21
Show file tree

Hide file tree

Showing 6 changed files with 11 additions and 3 deletions.
diff --git a/clang_tidy.sh b/clang_tidy.sh
diff --git a/src/algorithms/advanced/split_K_max.h → src/algorithms/searching/split_K_max.h b/src/algorithms/advanced/split_K_max.h → src/algorithms/searching/split_K_max.h
@@ -1,7 +1,13 @@
+#ifndef SPLIT_K_MAX_H
+#define SPLIT_K_MAX_H
+
+#ifdef __cplusplus
 #include <iostream>
 #include <numeric>
 #include <vector>
 #include <algorithm>
+#include <climits>
+#endif
 
 namespace helpers {
     /**
@@ -59,3 +65,5 @@ int minimum_max_sub_sum(std::vector<int> &v, int K) {
 
     return ans;
 }
+
+#endif
diff --git a/src/algorithms/advanced/convex_hull.h → src/algorithms/sorting/convex_hull.h b/src/algorithms/advanced/convex_hull.h → src/algorithms/sorting/convex_hull.h
diff --git a/src/algorithms/sorting/minimum_swaps.h b/src/algorithms/sorting/minimum_swaps.h
@@ -6,6 +6,7 @@
 #include <vector>
 #include <cassert>
 #include <map>
+#include <algorithm>
 #endif
 
 /**

diff --git a/tests/algorithms/advanced/split_K_max.cc → tests/algorithms/searching/split_K_max.cc b/tests/algorithms/advanced/split_K_max.cc → tests/algorithms/searching/split_K_max.cc
@@ -1,5 +1,4 @@
-#define CATCH_CONFIG_MAIN
-#include "../../../src/algorithms/advanced/split_K_max.h"
+#include "../../../src/algorithms/searching/split_K_max.h"
 #include "../../../third_party/catch.hpp"
 
 TEST_CASE("Testing split_K_max [1]") {

diff --git a/tests/algorithms/advanced/convex_hull.cc → tests/algorithms/sorting/convex_hull.cc b/tests/algorithms/advanced/convex_hull.cc → tests/algorithms/sorting/convex_hull.cc
@@ -1,5 +1,5 @@
 #include "../../../third_party/catch.hpp"
-#include "../../../src/algorithms/advanced/convex_hull.h"
+#include "../../../src/algorithms/sorting/convex_hull.h"
 
 TEST_CASE("Testing convex hull with graham's scan [1]") {
     std::vector<std::pair<int, int> > points = { {0, 3}, {1, 1}, {2, 2}, {4, 4}, {0, 0}, {1, 2}, {3, 1}, {3, 3}, {2, 4}, {4, 0} };