Skip to content

Fix bracktrack time complexity #965

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 10 commits into from
Jul 6, 2019
Merged

Conversation

Erfaniaa
Copy link
Member

@Erfaniaa Erfaniaa commented Jul 6, 2019

@poyea @siriak please review and merge this one.

@Erfaniaa
Copy link
Member Author

Erfaniaa commented Jul 6, 2019

@AnupKumarPanwar

Copy link
Member

@AnupKumarPanwar AnupKumarPanwar left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

LGTM

@Erfaniaa
Copy link
Member Author

Erfaniaa commented Jul 6, 2019

LGTM

@AnupKumarPanwar
Please don't merge it now.
This commit contains two changes.
I'm not sure about the time complexity of all_subsequences. Is it O(2^n) or O(2^n * n)? What's your idea?

@Erfaniaa Erfaniaa merged commit 69bed59 into master Jul 6, 2019
@Erfaniaa Erfaniaa deleted the fix-bracktrack-time-complexity branch July 6, 2019 15:32
stokhos pushed a commit to stokhos/Python that referenced this pull request Jan 3, 2021
* Update backtracking/all_permutations.py
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

4 participants