Loopless algorithm
id:
loopless-algorithm-314-9583752
title:
Loopless algorithm
text:
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. A loopless functional algorithm is a functional algorithm that takes the form unfoldr step • prolog where step takes constant time and
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Loopless_algorithm
date created:
date modified:
2023-08-13T18:35:37Z
main entity:
{"identifier":"Q6675889","url":"https://www.wikidata.org/entity/Q6675889"}
image:
fields total:
13
integrity:
13