Longest increasing subsequence: Difference between revisions
Content added Content deleted
(→Tcl: Added implementation) |
m (Better as ref?) |
||
Line 9:
;Ref:
# [http://www.youtube.com/watch?v=4fQJGoeW5VE Dynamic Programming #1: Longest Increasing Subsequence] on Youtube
▲An efficient solution is based on [[wp:Patience sorting|Patience sorting]].
=={{header|Java}}==
| |||