Anonymous user
Talk:Longest increasing subsequence: Difference between revisions
Talk:Longest increasing subsequence (view source)
Revision as of 16:04, 8 September 2013
, 10 years ago→Splitting in two subtasks?: Algorithm agnostic.
(complexity might be pretty, but also unnecessary?) |
(→Splitting in two subtasks?: Algorithm agnostic.) |
||
Line 23:
: Note also that neither of those algorithms is necessary for the task as it is currently defined. --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 22:56, 7 September 2013 (UTC)
::Yep, it's algorithm agnostic so far. I originally only knew of the one way of doing things and am grateful for the others.--[[User:Paddy3118|Paddy3118]] ([[User talk:Paddy3118|talk]]) 16:04, 8 September 2013 (UTC)
| |||