Refactored files, removed main func, added tests.

Signed-off-by: Jobin John <[email protected]>

Author: Mystigan

strings/naiveStringSearch.go renamed to strings/naivesearch/naiveStringSearch.go

@@ -8,15 +8,11 @@ Time Complexity : O(n*m)
     m = length of pattern
 */
 
-package main
-
-import (
-	"fmt"
-)
+package naivesearch
 
 func naivePatternSearch(text string, pattern string) []int {
 	var positions []int
-	for i := 0; i < len(text)-len(pattern); i++ {
+	for i := 0; i <= len(text)-len(pattern); i++ {
 		var match bool = true
 		for j := 0; j < len(pattern); j++ {
 			if text[i+j] != pattern[j] {
@@ -31,15 +27,3 @@ func naivePatternSearch(text string, pattern string) []int {
 	}
 	return positions
 }
-
-func main() {
-	text := "ABAAABCDBBABCDDEBCABC"
-	pattern := "ABC"
-	var positions []int = naivePatternSearch(text, pattern)
-	if len(positions) == 0 {
-		fmt.Printf("Pattern not found in given text!")
-	} else {
-		fmt.Printf("Pattern found in following position:\n")
-		fmt.Printf("%v", positions)
-	}
-}

strings/naivesearch/naiveStringSearch_test.go

@@ -0,0 +1,49 @@
+package naivesearch
+
+import (
+	"reflect"
+	"testing"
+)
+
+var testCases = []struct {
+	name     string
+	input    string
+	pattern  string
+	expected []int
+}{
+	{
+		"string with multiple pattern matches",
+		"ABAAABCDBBABCDDEBCABC",
+		"ABC",
+		[]int{4, 10, 18},
+	},
+	{
+		"string with single pattern match",
+		"ABCDEFGHIJKLMN",
+		"CDE",
+		[]int{2},
+	},
+	{
+		"string with no pattern match",
+		"ABCDEFGHIJKLMN",
+		"XYZ",
+		[]int(nil),
+	},
+	{
+		"empty string",
+		"",
+		"XYZ",
+		[]int(nil),
+	},
+}
+
+func TestNaivePatternSearch(t *testing.T) {
+	for _, tc := range testCases {
+		t.Run(tc.name, func(t *testing.T) {
+			actual := naivePatternSearch(tc.input, tc.pattern)
+			if !reflect.DeepEqual(actual, tc.expected) {
+				t.Errorf("Expected matches for pattern '%s' for string '%s' are: %v, but actual matches are: %v", tc.pattern, tc.input, tc.expected, actual)
+			}
+		})
+	}
+}