Longest Common Subsequence problem using recursion without using memorization.

LongestCommonSubsequenceWithoutMemorization.java

public class LongestCommonSubsequenceWithoutMemorization {
	private static char[] A;
	private static char[] B;
	
	private static int longestCommonSubsequent(int i, int j) {
		if (i == A.length || j == B.length) {
			return 0;
		} else if (A[i] == B[j]) {
			return 1 + longestCommonSubsequent(i + 1, j + 1);
		} else {
			return Integer.max(longestCommonSubsequent(i + 1, j), longestCommonSubsequent(i, j + 1));
		}
	}
	
	public static void main(String[] args) {
		A = "bd".toCharArray();
		B = "abcd".toCharArray();
		
		System.out.println(longestCommonSubsequent(0, 0));
	}
}