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.

Sign up for GitHub

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

Fix bracktrack time complexity #965

Changes from all commits
Commits
Show all changes
10 commits
Select commit Hold shift + click to select a range
36ecbc7
Fix typo
Erfaniaa May 14, 2019
0bc69d4
Merge branch 'master' of github.com:TheAlgorithms/Python
Erfaniaa May 27, 2019
e6167c6
Merge branch 'master' of github.com:TheAlgorithms/Python
Erfaniaa Jul 5, 2019
ab9a607
Add all_permutations algorithm to backtracking directory
Erfaniaa Jul 5, 2019
deb0cdc
Add all_subsequences to backtracking directory
Erfaniaa Jul 6, 2019
c0cebee
Fix time complexity
Erfaniaa Jul 6, 2019
d681547
Fix time complexity
Erfaniaa Jul 6, 2019
2d6ef16
Merge branch 'all-subsequences' into fix-bracktrack-time-complexity
Erfaniaa Jul 6, 2019
5304ec0
Fix time complexities
Erfaniaa Jul 6, 2019
9d2a2b3
Update backtracking/all_subsequences.py
siriak Jul 6, 2019
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion backtracking/all_permutations.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,7 @@
In this problem, we want to determine all possible permutations
of the given sequence. We use backtracking to solve this problem.

Time complexity: O(n!),
Time complexity: O(n! * n),
where n denotes the length of the given sequence.
'''

Expand Down