Jump to content

Longest increasing subsequence: Difference between revisions

m
Better as ref?
(→‎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 iscan be based on [[wp:Patience sorting|Patience sorting]].
 
An efficient solution is based on [[wp:Patience sorting|Patience sorting]].
 
=={{header|Java}}==
Anonymous user
Cookies help us deliver our services. By using our services, you agree to our use of cookies.