001
002
003
004
005
006
007
008
009
010
011
012
013
014
015
016
017
018
019
020
021
022
023
024
025
026
027
028
029
030
031
032
033
034
035
036
037
038
039
040
041
042
043
044
045
046
047
048
049
050
051
052
053
054
055
056
057
058
059
060
061
062
063
064
065
066
067
068
069
070
071
072
073
074
075
076
077
078
079
080
081
082
083
084
085
086
087
088
089
090
091
092
093
094
095
096
097
098
099
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
package algs53; // section 5.3
import stdlib.*;
/* *************************************************************
 *
 *  Compilation:  javac Brtue.java
 *  Execution:    java Brute pattern text
 *
 *  Reads in two strings, the pattern and the input text, and
 *  searches for the pattern in the input text using brute force.
 *
 *  % java Brute abracadabra abacadabrabracabracadabrabrabracad
 *  text:    abacadabrabracabracadabrabrabracad
 *  pattern:               abracadabra
 *
 *  % java Brute rab abacadabrabracabracadabrabrabracad
 *  text:    abacadabrabracabracadabrabrabracad
 *  pattern:         rab
 *
 *  % java Brute rabrabracad abacadabrabracabracadabrabrabracad
 *  text:    abacadabrabracabracadabrabrabracad
 *  pattern:                        rabrabracad

 *
 *  % java Brute bcara abacadabrabracabracadabrabrabracad
 *  text:    abacadabrabracabracadabrabrabracad
 *  pattern:                                   bcara
 *
 *  % java Brute abacad abacadabrabracabracadabrabrabracad
 *  text:    abacadabrabracabracadabrabrabracad
 *  pattern: abacad
 *
 ***************************************************************/

public class XBrute {

  /* *************************************************************************
   *  String versions
   ***************************************************************************/

  // return offset of first match or N if no match
  public static int search1(String pat, String txt) {
    int M = pat.length();
    int N = txt.length();

    for (int i = 0; i <= N - M; i++) {
      int j;
      for (j = 0; j < M; j++) {
        if (txt.charAt(i+j) != pat.charAt(j))
          break;
      }
      if (j == M) return i;            // found at offset i
    }
    return N;                            // not found
  }

  // return offset of first match or N if no match
  public static int search2(String pat, String txt) {
    int M = pat.length();
    int N = txt.length();
    int i, j;
    for (i = 0, j = 0; i < N && j < M; i++) {
      if (txt.charAt(i) == pat.charAt(j)) j++;
      else { i -= j; j = 0;  }
    }
    if (j == M) return i - M;    // found
    else        return N;        // not found
  }


  /* *************************************************************************
   *  char[] array versions
   ***************************************************************************/

  // return offset of first match or N if no match
  public static int search1(char[] pattern, char[] text) {
    int M = pattern.length;
    int N = text.length;

    for (int i = 0; i <= N - M; i++) {
      int j;
      for (j = 0; j < M; j++) {
        if (text[i+j] != pattern[j])
          break;
      }
      if (j == M) return i;            // found at offset i
    }
    return N;                            // not found
  }

  // return offset of first match or N if no match
  public static int search2(char[] pattern, char[] text) {
    int M = pattern.length;
    int N = text.length;
    int i, j;
    for (i = 0, j = 0; i < N && j < M; i++) {
      if (text[i] == pattern[j]) j++;
      else { i -= j; j = 0;  }
    }
    if (j == M) return i - M;    // found
    else        return N;        // not found
  }


  // test client
  public static void main(String[] args) {
    //args = new String[] { "abracadabra", "abacadabrabracabracadabrabrabracad" };
    //args = new String[] { "rab",         "abacadabrabracabracadabrabrabracad" };
    //args = new String[] { "bcara",       "abacadabrabracabracadabrabrabracad" };
    //args = new String[] { "rabrabracad", "abacadabrabracabracadabrabrabracad" };
    args = new String[] { "abacad",      "abacadabrabracabracadabrabrabracad" };
    String pat1 = args[0];
    String txt1 = args[1];
    char[] pat2 = pat1.toCharArray();
    char[] txt2 = txt1.toCharArray();

    int offset1a = search1(pat1, txt1);
    int offset2a = search2(pat1, txt1);
    int offset1b = search1(pat2, txt2);
    int offset2b = search2(pat2, txt2);

    // print results
    StdOut.println("text:    " + txt1);

    // from brute force search method 1a
    StdOut.print("pattern: ");
    for (int i = 0; i < offset1a; i++)
      StdOut.print(" ");
    StdOut.println(pat1);

    // from brute force search method 2a
    StdOut.print("pattern: ");
    for (int i = 0; i < offset2a; i++)
      StdOut.print(" ");
    StdOut.println(pat2);

    // from brute force search method 1b
    StdOut.print("pattern: ");
    for (int i = 0; i < offset1b; i++)
      StdOut.print(" ");
    StdOut.println(pat1);

    // from brute force search method 2b
    StdOut.print("pattern: ");
    for (int i = 0; i < offset2b; i++)
      StdOut.print(" ");
    StdOut.println(pat2);
  }
}