Abstract
A systolic algorithm is described for generating, in lexicographically ascending order, all combinations of m objects chosen from {1,…, n}. The algorithm is designed to be executed on a linear array of m processors, each having constant size memory, and each being responsible for producing one element of a given combination. There is a constant delay per combination, leading to an O( C( m, n)) time solution, where C( m, n) is the total number of combinations. The algorithm is cost optimal (assuming the time to output the combinations is counted), does not deal with very large integers, and is much simpler than the previously known solutions that enjoy same properties.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
