Longest increasing subsequence
Computer science problem / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Longest increasing subsequence?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
In computer science, the longest increasing subsequence problem aims to find a subsequence of a given sequence in which the subsequence's elements are sorted in an ascending order and in which the subsequence is as long as possible. This subsequence is not necessarily contiguous or unique. The longest increasing subsequences are studied in the context of various disciplines related to mathematics, including algorithmics, random matrix theory, representation theory, and physics.[1][2] The longest increasing subsequence problem is solvable in time where denotes the length of the input sequence.[3]