Merge pull request #48 from Dharni0607/strings

created strings folder and added naiveStringSearch

Author: yanglbme

strings/naiveStringSearch.go

@@ -0,0 +1,45 @@
+/*
+This algorithm tries to search the given pattern in the given text.
+If pattern is found from index position i in the text, 
+it is added to positions.
+
+Time Complexity : O(n*m)
+    n = length of text
+    m = length of pattern 
+*/
+
+package main
+
+import (  
+    "fmt"
+)
+
+func naivePatternSearch(text string, pattern string) []int { 
+    var positions []int 
+    for i := 0; i < len(text); i++ {
+        var match bool = true
+        for j := 0; j < len(pattern); j++ {
+            if text[i+j] != pattern[j] {
+                match = false
+                break
+            }
+        }
+        if match {
+            positions = append(positions, i)
+        }
+    }   
+    return positions
+}
+
+func main() {  
+    text := "ABAAABCDBBABCDDEBCABC"
+    pattern := "ABC"
+    var positions []int
+    positions = 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)
+    }
+}