Loopless algorithm

In computational combinatorics, a loopless algorithm or loopless imperative algorithm is an imperative algorithm that generates successive combinatorial objects, such as partitions, permutations, and combinations, in constant time and the first object in linear time. The objects must be immediately available in simple form without requiring any additional steps.

Comment
enIn computational combinatorics, a loopless algorithm or loopless imperative algorithm is an imperative algorithm that generates successive combinatorial objects, such as partitions, permutations, and combinations, in constant time and the first object in linear time. The objects must be immediately available in simple form without requiring any additional steps.
Has abstract
enIn computational combinatorics, a loopless algorithm or loopless imperative algorithm is an imperative algorithm that generates successive combinatorial objects, such as partitions, permutations, and combinations, in constant time and the first object in linear time. The objects must be immediately available in simple form without requiring any additional steps. A loopless functional algorithm is a functional algorithm that takes the form unfoldr step • prolog where step takes constant time and prolog takes linear time in the size of the input. The standard function unfoldr is a right-associative Bird unfold.
Hypernym
Algorithm
Is primary topic of
Loopless algorithm
Label
enLoopless algorithm
Link from a Wikipage to another Wikipage
Algorithm
Anamorphism
Category:Combinatorial algorithms
Combination
Combinatorics
Constant time
Functional programming
Imperative programming
Linear time
Partition of a set
Permutation
Richard Bird (computer scientist)
Subroutine
SameAs
4qof5
Loopless algorithm
m.06zqsv1
Q6675889
Subject
Category:Combinatorial algorithms
WasDerivedFrom
Loopless algorithm?oldid=994258819&ns=0
WikiPageLength
2299
Wikipage page ID
23722890
Wikipage revision ID
994258819
WikiPageUsesTemplate
Template:Combin-stub
Template:Reflist