Python

mathdatech/Python

Fork 0

mirror of https://github.com/TheAlgorithms/Python.git synced 2024-11-24 05:21:09 +00:00

Commit Graph

Author	SHA1	Message	Date
dhruvsaini	436edf3a88	Create longest_increasing_subsequence.py The Longest Increasing Subsequence (LIS) problem is to find the length of the longest subsequence of a given sequence such that all elements of the subsequence are sorted in increasing order. For example, the length of LIS for {10, 22, 9, 33, 21, 50, 41, 60, 80} is 6	2017-01-03 16:54:38 +05:30

Author

SHA1

Message

Date

dhruvsaini

436edf3a88

Create longest_increasing_subsequence.py

The Longest Increasing Subsequence (LIS) problem is to find the length of the longest subsequence of a given sequence such that all elements of the subsequence are sorted in increasing order. For example, the length of LIS for {10, 22, 9, 33, 21, 50, 41, 60, 80} is 6

2017-01-03 16:54:38 +05:30

1 Commits