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
Code Example |
---|
C :: C program to find power of any number |
C :: algorithm for dequeue |
C :: c pause for 1 second |
C :: stack and heap memorym in ram |
C :: convert video to gif with ffmpeg |
C :: define constant c |
C :: while loop c |
C :: C# special character display |
C :: compile in c |
C :: declaration of string in c |
C :: c arrays and pointers |
C :: typedef c |
C :: yt derived field |
C :: Returns numbers between i and 0 |
C :: entity framework core discard changes |
C :: String to Integer (atoi) |
C :: <fileset joomla |
C :: parcel-bundler include image files |
C :: tytykjtuky |
C :: minimun number of moves in c |
C :: asasz |
C :: c limit value range |
C :: (avar == 1) ? (bvar == 2 ? result = 3 : (result = 5);) : (result = 0); |
C :: what the value in array not initialized yet c |
C :: C #define preprocessor |
C :: levenshtein c |
C :: function of science writing of a number |
C :: Word Processor, Spreadsheet and Presentation Software are the examples of |
C :: helloworld c |
C :: open cv |