aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

update meta data

Browse source
This commit is contained in:
Ingy döt Net 2013-04-11 12:07:39 -07:00
parent f3a896c724
commit 90e15ed6ce
3307 changed files with 1674 additions and 7 deletions
Download patch file Download diff file Expand all files Collapse all files

11
Task/Non-continuous-subsequences/00DESCRIPTION Normal file
View file

@ -0,0 +1,11 @@
Consider some sequence of elements. (It differs from a mere set of elements by having an ordering among members.)
A ''subsequence'' contains some subset of the elements of this sequence, in the same order.
A ''continuous'' subsequence is one in which no elements are missing between the first and last elements of the subsequence.
Note: Subsequences are defined ''structurally'', not by their contents. So a sequence ''a,b,c,d'' will always have the same subsequences and continuous subsequences, no matter which values are substituted; it may even be the same value.
'''Task''': Find all non-continuous subsequences for a given sequence. Example: For the sequence ''1,2,3,4'', there are five non-continuous subsequences, namely ''1,3''; ''1,4''; ''2,4''; ''1,3,4'' and ''1,2,4''.
'''Goal''': There are different ways to calculate those subsequences. Demonstrate algorithm(s) that are natural for the language.