Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
Recursion challenge
#1
Do what you want, graphics, math, annoying sounds.... but do it recursively! (Recursion is based on using a function that calls itself)

Code:
declare sub factorial&(x&)
print factorial&(10)
end

function factorial&(x&)
if x& then factorial&(x&)=x&*factorial&(x&-1) else factorial&=1
end function
Antoni
Reply


Messages In This Thread
Recursion challenge - by Antoni Gual - 06-26-2003, 08:04 PM
Recursion challenge - by Antoni Gual - 06-27-2003, 12:37 AM
Recursion challenge - by Moneo - 06-28-2003, 09:49 AM
I beg to differ. - by Agamemnus - 06-30-2003, 05:11 AM
Re: I beg to differ. - by Moneo - 06-30-2003, 06:22 AM
nah - by Agamemnus - 06-30-2003, 09:07 PM
Recursion challenge - by Antoni Gual - 07-01-2003, 01:13 AM
Recursion challenge - by Moneo - 07-01-2003, 02:25 AM
Recursion challenge - by LooseCaboose - 07-01-2003, 05:02 AM
To LooseCaboose: Re Gray's Code - by Moneo - 07-01-2003, 05:38 AM
Recursion challenge - by LooseCaboose - 07-01-2003, 05:52 AM
Recursion challenge - by Antoni Gual - 07-02-2003, 01:30 AM
Recursion challenge - by LooseCaboose - 07-03-2003, 03:30 PM
Recursion challenge - by Moneo - 07-03-2003, 11:14 PM
Recursion challenge - by Hexadecimal Disaster - 07-04-2003, 01:33 AM
Recursion challenge - by LooseCaboose - 07-04-2003, 09:25 AM
To LooseCaboose: - by Moneo - 07-04-2003, 09:15 PM
Recursion challenge - by LooseCaboose - 07-05-2003, 07:39 AM
To LooseCaboose: - by Moneo - 07-05-2003, 08:31 AM
Recursion challenge - by na_th_an - 07-12-2003, 06:43 PM

Forum Jump:


Users browsing this thread: 1 Guest(s)