Longest increasing subsequence: Difference between revisions

Content added Content deleted
(→‎Tcl: Added implementation)
m (Better as ref?)
Line 9: Line 9:
;Ref:
;Ref:
# [http://www.youtube.com/watch?v=4fQJGoeW5VE Dynamic Programming #1: Longest Increasing Subsequence] on Youtube
# [http://www.youtube.com/watch?v=4fQJGoeW5VE Dynamic Programming #1: Longest Increasing Subsequence] on Youtube
⚫
# An efficient solution can be based on [[wp:Patience sorting|Patience sorting]].

⚫
An efficient solution is based on [[wp:Patience sorting|Patience sorting]].


=={{header|Java}}==
=={{header|Java}}==
Retrieved from "https://rosettacode.org/wiki/Longest_increasing_subsequence"