Pattern matching in O(n * m)

StringMatching.java

package com.prashanth;

public class StringMatching {
    public static void main(String[] args) {
        
        String pattern = "eeccd";

        String word = "cceeccd";

        int k = 0;
        for (int i = 0; i < word.length(); i++) {
            int l = i;
            for (int j = k; j < pattern.length();) {
                if (word.charAt(l) == pattern.charAt(j)) {
                    j++;
                    k++;
                    l++;
                } else {
                    j=0;
                    k=0;
                    break;
                }
            }
        }

        if (pattern.length() == k) {
            System.out.println("Pattern found in the given text");
        } else {
            System.out.println("Pattern not found in the given text");
        }
    }
}