Skip to content

Create longest_increasing_subsequence.py#62

Merged
harshildarji merged 1 commit intoTheAlgorithms:masterfrom
dhruvsaini:patch-4
Jan 3, 2017
Merged

Create longest_increasing_subsequence.py#62
harshildarji merged 1 commit intoTheAlgorithms:masterfrom
dhruvsaini:patch-4

Conversation

@dhruvsaini
Copy link
Copy Markdown
Contributor

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

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
@harshildarji harshildarji merged commit 6f9d65f into TheAlgorithms:master Jan 3, 2017
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants