TheAlgorithms · Erfaniaa · Jul 6, 2019 · May 14, 2019 · May 27, 2019 · Jul 5, 2019
diff --git a/backtracking/all_permutations.py b/backtracking/all_permutations.py
@@ -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.
 '''
 

diff --git a/backtracking/all_subsequences.py b/backtracking/all_subsequences.py
@@ -2,7 +2,7 @@
 	In this problem, we want to determine all possible subsequences
 	of the given sequence. We use backtracking to solve this problem.
 
-	Time complexity: O(2^n),
+	Time complexity: O(2^n * n),
 	where n denotes the length of the given sequence.
 '''