recursivitate.pas

袖珍型的pascal编译器

{program care testeaza recursivitatea}

program recursivitate;

var x:integer;
	c:char;
	count : integer;

{factorial function}

function factorial (i:integer):integer;
begin	
	count := count + 1;
	if i = 1 then
		factorial := -1
	else 
		factorial := factorial(i-1) * i;
end;

begin
count := 0;
print ( "x=" );
read ( x );
print (factorial(x),"\n\r");
print (count);
read(c);
end.