def naive_longest_inc_subseq(seq):
    for length in range(len(seq), 0, -1):
        for sub in combinations(seq, length):
            if list(sub) == sorted(sub):
                return len(sub)
naive (exponential) solution to the longest increasing subsequence problem
dataset/ETHPy150Open bt3gl/Python-and-Algorithms-and-Data-Structures/src/USEFUL/dynamic_programming/memoized_longest_inc_subseq.py/naive_longest_inc_subseq