Implement unit test for boyer moore

Author: cschen1205

cs-algorithms/Strings/Search/BoyerMoore.cs

@@ -0,0 +1,42 @@
+using System;
+
+namespace Algorithms.Strings.Search
+{
+    public class BoyerMoore
+    {
+        private int[] right;
+        private const int R = 256;
+        private int M;
+        private string pat;
+        public BoyerMoore(string pat)
+        {
+            this.pat = pat;
+            right = new int[R];
+            for (int i = 0; i < pat.Length; ++i)
+            {
+                right[pat[i]] = i;
+            }
+            M = pat.Length;
+        }
+
+        public int Search(string text)
+        {
+            int skip = 1;
+            for (int i = 0; i < text.Length - M; i+=skip)
+            {
+                var j;
+                for (j = M - 1; j >= 0; j--)
+                {
+                    if (text[i + j] != pat[j])
+                    {
+                        skip = Math.Max(1, j - right[text[i + j]]);
+                        break;
+                    }
+                }
+                if (j == -1) return i;
+            }
+            return -1;
+        }
+
+    }
+}