Merge pull request #176 from MrGrayCode/tower-of-hanoir-python

Tower of hanoir python

Author: xlogix

README.md

@@ -22,6 +22,7 @@ This repository contains examples of various algorithms written on different pro
 | [Merge Sort](https://en.wikipedia.org/wiki/Merge_sort)             | [:octocat:](merge_sort/clang)    | [:octocat:](merge_sort/cpp)     | [:octocat:](merge_sort/java)    | [:octocat:](merge_sort/Python)     |                                       |
 | [Insertion Sort](https://en.wikipedia.org/wiki/Insertion_sort)     |                                  | [:octocat:](insertion_sort/Cpp) | [:octocat:](insertion_sort/java)|                                    | [:octocat:](insertion_sort/javascript)|
 | [Counting Sort](https://en.wikipedia.org/wiki/Counting_sort)       | [:octocat:](counting_sort/clang) | [:octocat:](counting_sort/cpp)  | [:octocat:](counting_sort/java) | [:octocat:](counting_sort/Python)  |                                       |
+| [Tower of Hanoi](https://en.wikipedia.org/wiki/Tower_of_Hanoi)       | [:octocat:](towers_of_hanoi/clang) |                     |                | [:octocat:](towers_of_hanoi/Python)  |                                       |
 
 ## Implemented Data Structures
 

towers_of_hanoi/python/hanoi.py

@@ -0,0 +1,11 @@
+def towerOfHanoi(numberOfDisks, fromRod, toRod, auxRod):
+    if numberOfDisks == 1:
+        print("Move {} from {} to {}".format(numberOfDisks,fromRod,toRod))
+        return
+    towerOfHanoi(numberOfDisks-1,fromRod,auxRod,toRod)
+    print("Move {} from {} to {}".format(numberOfDisks,fromRod,toRod))
+    towerOfHanoi(numberOfDisks-1,auxRod,toRod,fromRod)
+
+if __name__ == "__main__":
+    n = int(input("Enter number of disks: "))
+    towerOfHanoi(n,'A','C','B')