Abstract
We give algorithms to generate all subsets of the n-element set that contain k elements. For brevity we sometimes refer to the \( \left( {_k^n } \right) \) combinations of k out of n elements as “the combinations \( \left( {_k^n } \right) \)”.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer Berlin Heidelberg
About this chapter
Cite this chapter
Arndt, J. (2011). Combinations. In: Matters Computational. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14764-7_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-14764-7_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14763-0
Online ISBN: 978-3-642-14764-7
eBook Packages: Computer ScienceComputer Science (R0)