Abstract
Algorithms are devised to generate lists of objects in Lexicographic-Order: k-sequences on {1..n}, all nonempty subsets of {1..n}, k-subsets of {1..n}, full permutations, and k-permutations on {1..n}. We include calculations of average-case complexity because in each case the average cost is less than 2 or 3 operations no matter how big k and n are.
This is a preview of subscription content, log in via an institution to check access.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag London
About this chapter
Cite this chapter
Jenkyns, T., Stephenson, B. (2013). Generating Sequences and Subsets. In: Fundamentals of Discrete Math for Computer Science. Undergraduate Topics in Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-4069-6_8
Download citation
DOI: https://doi.org/10.1007/978-1-4471-4069-6_8
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-4471-4068-9
Online ISBN: 978-1-4471-4069-6
eBook Packages: Computer ScienceComputer Science (R0)