length of longest increasing subsequence

lisBigger.py

#!/usr/bin/python
def lisBigger(prev, A):
    if len(A) == 0:
        return 0
    max = lisBigger(prev, A[1:])
    if A[0] > prev:
        L = 1 + lisBigger(A[0], A[1:])
        if L > max:
            max = L
    return max

X = [0, 3, 2]

# returns 2 because subsequence [0, 2] is increasing
print lisBigger(-999, X)