Talk:Longest increasing subsequence: Difference between revisions
Talk:Longest increasing subsequence (view source)
Revision as of 22:56, 7 September 2013
, 10 years agocomplexity might be pretty, but also unnecessary?
(→Splitting in two subtasks?: Do we need to?) |
(complexity might be pretty, but also unnecessary?) |
||
Line 21:
: Are you going to take the effort to work out what all the existing solutions are supposed to be categorised as? Or take the effort to locate descriptions of the algorithms of sufficient quality to allow implementation generally? (I say that because the description on Wikipedia of the LIS algorithm is poor.) –[[User:Dkf|Donal Fellows]] ([[User talk:Dkf|talk]]) 10:54, 19 August 2013 (UTC)
: 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)
| |||