The code of O(2^n) isn't correct which is O(n)

Need solve two smaller problems in one recursive call
IanTaehoonYoo · Aug 8, 2019 · 762de52 · 762de52
1 parent 667d265
commit 762de52
Showing 1 changed file with 2 additions and 3 deletions.
diff --git a/Big-O Notation.markdown b/Big-O Notation.markdown
@@ -124,9 +124,8 @@ Below are some examples for each category of performance:
   func solveHanoi(n: Int, from: String, to: String, spare: String) {
     guard n >= 1 else { return }
     if n > 1 {
-      solveHanoi(n: n - 1, from: from, to: spare, spare: to)
-    } else {
-      solveHanoi(n: n - 1, from: spare, to: to, spare: from)
+        solveHanoi(n: n - 1, from: from, to: spare, spare: to)
+        solveHanoi(n: n - 1, from: spare, to: to, spare: from)
     }
   }
   ```