LinearSearch.java

public class LinearSearch {
	public static int linearSearch(String[] haystack, String needle) {
		for (int i = 0; i < haystack.length; i++) {
			if (needle.equals(haystack[i])) {
				return i;
			}
		}

		return -1;
	}
}

public class LinearSearch {
	public static int linearSearch(String[] haystack, String needle) {
		int result = -1;
		
		for (int i = 0; i < haystack.length; i++) {
			if (needle.equals(haystack[i])) {
				result = i;
				break;
			}
		}
		
		return result;
	}
}