Lexicographical Ordering of k-Subsets of a Set
From MaRDI portal
A recursive algorithm for generating all k-subsets (1\(\leq k\leq m\leq n)\) of a set \(\{\) 1,2,3,...,n\(\}\) in lexicographical order is described. The algorithm runs at O(1) units of time. An empirical testing shows that the recursive algorithm runs faster than Nijenhuis and Wilf's iterative algorithm for doing the same task.
Recommendations
Cited in
(7)- Some examples of lexicographic order algorithms and some open combinatorial problems
- scientific article; zbMATH DE number 3917730 (Why is no real title available?)
- scientific article; zbMATH DE number 559036 (Why is no real title available?)
- Approximate Quadrature Measures on Data-Defined Spaces
- Unranking of small combinations from large sets
- scientific article; zbMATH DE number 822743 (Why is no real title available?)
- Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees
This page was built for publication: Lexicographical Ordering of k-Subsets of a Set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3742726)