L

Longest increasing subsequence

Algorithm to find the longest increasing subsequence in an array of numbers

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.

Nº Q4183855 ★

Common · History

Longest increasing subsequence

Algorithm to find the longest increasing subsequence in an array of numbers

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.

From Wikipedia

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. The longest increasing subsequence problem is solvable in time O ( n log ⁡ n ) , {\displaystyle O(n\log n),} where n {\displaystyle n} denotes the length of the input sequence.

Text: Wikipédia, CC BY-SA 4.0. ·

Related cards

Open

…

Confirmation