[chore] update readme

pROGRAMMERDATASCIENCE22 · Nov 20, 2020 · 72c2862 · 72c2862
1 parent da3188a
commit 72c2862
Show file tree

Hide file tree

Showing 2 changed files with 48 additions and 0 deletions.
diff --git a/README.md b/README.md
@@ -88,6 +88,7 @@ A catalogue of data structures implementation + algorithms and coding problems a
 - [Recursive binary search](recursion/recursive_binary_search.ipynb)
 - [Simulate rocket countdown](recursion/simulate_rocket_countdown.ipynb)
 - [Find min and max in array](recursion/min_max.ipynb)
+- [Tower of Hanoi](recursion/tower_of_hanoi.ipynb)
 
 ## Searching
 

diff --git a/recursion/tower_of_hanoi.ipynb b/recursion/tower_of_hanoi.ipynb
@@ -65,6 +65,53 @@
     "tower_of_hanoi(3, 1, 2, 3)"
    ]
   },
+  {
+   "cell_type": "code",
+   "execution_count": 5,
+   "metadata": {},
+   "outputs": [
+    {
+     "name": "stdout",
+     "output_type": "stream",
+     "text": [
+      "Moving 1 to 3\n",
+      "Moving 1 to 2\n",
+      "Moving 3 to 2\n",
+      "Moving 1 to 3\n",
+      "Moving 2 to 1\n",
+      "Moving 2 to 3\n",
+      "Moving 1 to 3\n",
+      "Moving 1 to 2\n",
+      "Moving 3 to 2\n",
+      "Moving 3 to 1\n",
+      "Moving 2 to 1\n",
+      "Moving 3 to 2\n",
+      "Moving 1 to 3\n",
+      "Moving 1 to 2\n",
+      "Moving 3 to 2\n",
+      "Moving 1 to 3\n",
+      "Moving 2 to 1\n",
+      "Moving 2 to 3\n",
+      "Moving 1 to 3\n",
+      "Moving 2 to 1\n",
+      "Moving 3 to 2\n",
+      "Moving 3 to 1\n",
+      "Moving 2 to 1\n",
+      "Moving 2 to 3\n",
+      "Moving 1 to 3\n",
+      "Moving 1 to 2\n",
+      "Moving 3 to 2\n",
+      "Moving 1 to 3\n",
+      "Moving 2 to 1\n",
+      "Moving 2 to 3\n",
+      "Moving 1 to 3\n"
+     ]
+    }
+   ],
+   "source": [
+    "tower_of_hanoi(5, a=1, b=2, c=3)"
+   ]
+  },
   {
    "cell_type": "code",
    "execution_count": null,