AbstractWe give a history dependent algorithm that satisfies the claims of the title. It has other desirable attributes as well. It is computationally much simpler than algorithms studied in recent work of Payne and Ives when, in enumerating n objects k at a time, k is small compared to n. In fact SN(n,k) decreases n -* - where SN denotes the complexity of the present method and PI , that of Payne-Ives. This is probably due to the savings in overhead required by history less enumeration.
SubjectsCombinations, Pointers, Constant weight codes, Hamiltonian circuits on the N-cube, Binomial coefficients
RightsThis Item is protected by copyright and/or related rights.You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use.For other uses you need to obtain permission from the rights-holder(s).