Hacktoberfest2021
Hacktoberfest2021 copied to clipboard
added iterative combination algorithm.java
Description:
Iterative Combination Algorithm solution for finding all possible combination of k sized sub list of elements in ascending order for a given array or list of size n, where (2 <= k <= n)
Fixes #issue_number_here
Type of change:
- [x] Bug fix (non-breaking change which fixes an issue)
- [x] New feature (non-breaking change which adds functionality)
- [x] Breaking change (fix or feature that would cause existing functionality to not work as expected)
- [x] This change requires a documentation update
Checklist:
- [x] My code follows the style guidelines of this project.
- [x] I have performed a self-review of my own code.
- [x] I have commented my code, particularly in hard-to-understand areas.
- [x] I have made corresponding changes to the documentation.
- [x] My changes generate no new warnings.
- [x] I have added tests that prove my fix is effective or that my feature works.
- [x] New and existing unit tests pass locally with my changes.
- [x] Any dependent changes have been merged and published in downstream modules.