From 762de527ad71e07f36ca9fd417819d733d298bdd Mon Sep 17 00:00:00 2001 From: markgz Date: Thu, 8 Aug 2019 17:09:28 +0800 Subject: [PATCH] The code of O(2^n) isn't correct which is O(n) Need solve two smaller problems in one recursive call --- Big-O Notation.markdown | 5 ++--- 1 file changed, 2 insertions(+), 3 deletions(-) diff --git a/Big-O Notation.markdown b/Big-O Notation.markdown index 9509331a5..c3f020df2 100644 --- 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) } } ```