Hanoï recursive algorithm

procédure Hanoï(n, D, A, I)
    si n ≠ 0
        Hanoï(n-1, D, I, A)
        Déplacer le disque de D vers A
        Hanoï(n-1, I, A, D)
    fin-si
fin-procédure

Source: fr.wikipedia.org

Similar codes

30 votes342 views6 answers
Retrofit android
Java
0 vote462 views2 answers
Interview questions on ds and algo
Java
0 vote402 views1 answer
Spring core xml configuration for collection using constructor
Java Spring
0 vote348 views1 answer
Wsl-allow-port
Java
1 vote318 views1 answer
Latest dependency for snackbar android
Java
0 vote325 views1 answer
If not java
Java
0 vote353 views1 answer
App not showing in share menu android
Java
0 vote371 views1 answer
Send bitmap as multipart java android retrofit
Java
4 votes385 views1 answer
Rates api
Java
0 vote416 views1 answer
How to get internet speed in android programmatically
Java