Delete empty files, rename some fies, some smoll code correction and add test with 0 lenght array

Author: Romanov-Fedor

task_01/src/main.cpp

@@ -2,7 +2,7 @@
 #include <utility>
 #include <vector>
 
-#include "Searching_sum.hpp"
+#include "searching_sum.hpp"
 
 int main() {
   int n, k;

task_01/src/Searching_sum.cpp renamed to task_01/src/searching_sum.cpp

@@ -1,4 +1,4 @@
-#include "Searching_sum.hpp"
+#include "searching_sum.hpp"
 
 #include <utility>
 
@@ -7,9 +7,9 @@ std::pair<int, int> SearchingSum(std::vector<int> vec, int num) {
   int end = vec.size() - 1;
   while (start < end) {
     if (vec[start] + vec[end] > num)
-      end--;
+      --end;
     else if (vec[start] + vec[end] < num)
-      start++;
+      ++start;
     else
       return std::make_pair(start, end);
   }

task_01/src/Searching_sum.hpp renamed to task_01/src/searching_sum.hpp

@@ -3,6 +3,7 @@
 
 #include <utility>
 #include <vector>
+
 std::pair<int, int> SearchingSum(std::vector<int> vec, int num);
 
 #endif  // define Searching_sum.hpp

task_01/src/test.cpp

@@ -1,10 +1,9 @@
-
 #include <gtest/gtest.h>
 
 #include <utility>
 #include <vector>
 
-#include "Searching_sum.hpp"
+#include "searching_sum.hpp"
 
 TEST(TopologySort, Simple) {
   int sum1 = 6;
@@ -41,4 +40,9 @@ TEST(TopologySort, Simple) {
   std::vector<int> vec7{-18, -10, -1, -1, -1, 0, 3, 5, 10};
   std::pair<int, int> ans7{2, 5};
   ASSERT_EQ(SearchingSum(vec7, sum7), ans7);
+
+  int sum8 = 5;
+  std::vector<int> vec8(0);
+  std::pair<int, int> ans8{-1, -1};
+  ASSERT_EQ(SearchingSum(vec8, sum8), ans8);
 }