Talk:Non-continuous subsequences: Difference between revisions
Content added Content deleted
(→solution sizes: new section) |
|||
| Line 19: | Line 19: | ||
==Suggestions for improvement== |
==Suggestions for improvement== |
||
After [http://blog.rosettacode.org/?p=186 this post] in the RC blog, I ended up here and thought the page could be improved if references to algorithms attempted where added to the tail of the task description and implementations referred to which they were following. --[[User:Paddy3118|Paddy3118]] 06:08, 12 May 2009 (UTC) |
After [http://blog.rosettacode.org/?p=186 this post] in the RC blog, I ended up here and thought the page could be improved if references to algorithms attempted where added to the tail of the task description and implementations referred to which they were following. --[[User:Paddy3118|Paddy3118]] 06:08, 12 May 2009 (UTC) |
||
== solution sizes == |
|||
The following comment was added to the C solution: "Note: This specimen can only handle lists of length less than the number of bits in an '''int'''." |
|||
While true, this is not likely to be a significant limit, in practice. The time required to calculate longer results and the space required to store them means that few implementations will be useful for longer lists. |
|||
But perhaps the C implementation should be changed to use a long? |
|||
--[[User:Rdm|Rdm]] 21:39, 6 June 2010 (UTC) |
|||