#20008: Implement non-recursive iterator for compositions
-------------------------------------+-------------------------------------
Reporter: tscrim | Owner: sage-combinat
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-7.1
Component: combinatorics | Resolution:
Keywords: iterator | Merged in:
Authors: Travis Scrimshaw | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
public/combinat/composition_iterator-20008|
a796f0eb320c7955d2007486fefd2407a9bb7345
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by darij):
Grammar error in doc.
More importantly, though, I'm not sure I understand the algorithm. Why
does it not decrement `s` in the `s > n` case? What is the logic behind
the algorithm anyway?
--
Ticket URL: <http://trac.sagemath.org/ticket/20008#comment:5>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at https://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
