hanoi.c

来自「用C语言递归算法实现的n层hanoi塔问题解决」· C语言 代码 · 共 57 行

#include "time.h"
#include<stdio.h>

move( int n, int x, int y, int z )

{

    if( n==1 )

        printf( "%c-->%c\n", x, z );

    else

    {

        move( n-1, x, z, y);

        printf( "%c-->%c\n", x, z );

        move( n-1, y, x, z );

    }

}

 

main()

{

    int h;

    long timstart = 0;

    long timend = 0;

 

    printf( "\ninput number:\n" );

    scanf( "%d",&h );

    printf( "the step to moving %2d diskes:\n", h );

    time( &timstart );

    move(h,'a','b','c');

    time(&timend);

    timend -= timstart;

    printf( "\nthe process time is %ld seconds\n", timend );

}