Simple hanoi tower solution using stack and recusivity
Inspired in this IME USP homework.
$ ~ make
Will genarate a binary called hanoi
$ ~ /hanoi <arguments>
docker build -t gcc:hanoi .
docker run --rm -it gcc:hanoi <ARGUMENTS>
$ ~ ./hanoi -h
Hanoi Tower solution!
-r Use recursive algorithm
-s Use stack algorithm and shows the stack
-n Number of disks
-h Show help