Loopless algorithm
In computational
linear time.[1][2] The objects must be immediately available in simple form without requiring any additional steps.[1]
A loopless functional algorithm is a
References
- ^ ISSN 0004-5411.
- ISBN 0-201-85393-0.
- ^ doi:10.1007/11783596.
- OCLC 63162239.
.svg){kind=small} | This combinatorics-related article is a stub. You can help Wikipedia by expanding it. |