ALGORITHMO #19 - Naive String Search Implementation

ALGORITHMO-19-Naive-String-Search-Implementation.java

public class StringSearch {

	public static int getSubstringStartIndex(String text, String pattern) {
		int n = text.length();
		int m = pattern.length();
		
		for (int startIndex = 0; startIndex <= ( n - m ); ++startIndex) {
			int i = 0; 
			for (i = 0; i < m; ++i) {
				if (pattern.charAt(i) != text.charAt(startIndex + i)) {
					break;
				}
			}
			if (i == m) { // if all pairs of characters have matched
				return startIndex;
			}
		}
		
		return -1; // substring not found in string
	}
	
	public static void main(String[] args) {
		int substringStartIndex = getSubstringStartIndex("NOAH NOTICED", "NOT");
		
		System.out.println(substringStartIndex);
	}
}