Go Recursion – The Tower Of Hanoi

If you want to know the logic of the tower of Hanoi, please refer to this article Python recursion – The Tower of Hanoi. They are exactly the same, just using different language.

package main

import "fmt"

func hanoi(disk int, start string, end string, middle string) {
    if disk > 0 {
        hanoi(disk -1, start, middle, end)
        fmt.Printf("Move dist%d from %s to %s \n", disk, start, end)
        hanoi(disk - 1, middle, end, start)
    }
}

func main() {
    s := 3
    hanoi(s, "START", "END", "MIDDLE")
}
Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s