feat(Search): add naive string search and test

Author: azdanov

exercises/Search/Complete/SearchComplete.php

@@ -6,6 +6,7 @@
 
 use function count;
 use function intdiv;
+use function strlen;
 
 final class SearchComplete
 {
@@ -47,4 +48,22 @@ public static function binary(array $input, int $n): ?int
 
         return $input[$middle] === $n ? $middle : null;
     }
+
+    public static function naive(string $input, string $n): int
+    {
+        $counter = 0;
+
+        for ($i = 0, $iMax = strlen($input), $nMax = strlen($n); $i < $iMax; ++$i) {
+            for ($j = 0; $j < $nMax; ++$j) {
+                if ($n[$j] !== $input[$i + $j]) {
+                    break;
+                }
+                if ($j === $nMax - 1) {
+                    ++$counter;
+                }
+            }
+        }
+
+        return $counter;
+    }
 }

exercises/Search/Search.php

@@ -6,9 +6,11 @@
 
 /**
  * Implement Linear and Binary search that returns $n if found otherwise null.
+ * Implement Naive search that returns int repetitions of $n inside of a $string.
  *
  * @method static int|null linear(int[] $input, int $n)
  * @method static int|null binary(int[] $input, int $n)
+ * @method static int naive(string $input, string $n)
  */
 final class Search
 {

tests/Search/Complete/SearchCompleteTest.php

@@ -30,9 +30,8 @@ public function testLinear(): void
         );
         self::assertNull(
             SearchComplete::linear([34, 51, 1, 2, 3, 45, 56, 687], 100)
-        );self::assertNull(
-            SearchComplete::linear([], 100)
         );
+        self::assertNull(SearchComplete::linear([], 100));
     }
 
     public function testBinary(): void
@@ -43,8 +42,13 @@ public function testBinary(): void
         );
         self::assertNull(
             SearchComplete::binary([34, 51, 1, 2, 3, 45, 56, 687], 100)
-        );self::assertNull(
-            SearchComplete::binary([], 100)
         );
+        self::assertNull(SearchComplete::binary([], 100));
+    }
+
+    public function testNaive(): void
+    {
+        self::assertSame(3, SearchComplete::naive('ox mox pox', 'ox'));
+        self::assertSame(0, SearchComplete::naive('ox mox pox', 'box'));
     }
 }

tests/Search/SearchTest.php

@@ -27,19 +27,22 @@ public function testLinear(): void
     {
         self::markTestSkipped();
         self::assertSame(5, Search::linear([34, 51, 1, 2, 3, 45, 56, 687], 45));
-        self::assertNull(
-            Search::linear([34, 51, 1, 2, 3, 45, 56, 687], 100)
-        );
+        self::assertNull(Search::linear([34, 51, 1, 2, 3, 45, 56, 687], 100));
         self::assertNull(Search::linear([], 100));
     }
 
     public function testBinary(): void
     {
         self::markTestSkipped();
         self::assertSame(5, Search::binary([34, 51, 1, 2, 3, 45, 56, 687], 45));
-        self::assertNull(
-            Search::binary([34, 51, 1, 2, 3, 45, 56, 687], 100)
-        );
+        self::assertNull(Search::binary([34, 51, 1, 2, 3, 45, 56, 687], 100));
         self::assertNull(SearchComplete::binary([], 100));
     }
+
+    public function testNaive(): void
+    {
+        self::markTestSkipped();
+        self::assertSame(3, Search::naive('ox mox pox', 'ox'));
+        self::assertSame(0, Search::naive('ox mox pox', 'box'));
+    }
 }