Rystil Arden
First Post
Well, I bet you can beat the exponential algorithm that recursively calls (F n-1) + (F n-2) though, right?Steve Jung said:Not very.
Well, I bet you can beat the exponential algorithm that recursively calls (F n-1) + (F n-2) though, right?Steve Jung said:Not very.
Yeah, I think I have a mallet big enough for that...Rystil Arden said:Well, I bet you can beat the exponential algorithm that recursively calls (F n-1) + (F n-2) though, right?
You guys are no fun--you're supposed to propose a linear algorithm that starts with 1 and 1 and adds together to ever-increasing values to reach the answer more quickly.Jdvn1 said:Yeah, I think I have a mallet big enough for that...
... On the contrary, I think smacking equations with mallets is much more fun.Rystil Arden said:You guys are no fun--you're supposed to propose a linear algorithm that starts with 1 and 1 and adds together to ever-increasing values to reach the answer more quickly.
*Brain explodes*Rystil Arden said:Well, I bet you can beat the exponential algorithm that recursively calls (F n-1) + (F n-2) though, right?
... Oh, were you using that?Steve Jung said:*Brain explodes*
Oh, c'mon, its not that hard. Honest.Steve Jung said:*Brain explodes*
Well, not at the moment.Jdvn1 said:... Oh, were you using that?
Can you break it down more simply?Rystil Arden said:Oh, c'mon, its not that hard. Honest.
Well, you know what the Fibonacci series is, right? (I have on this very series of Hivemind threads met people who didn't, actually)Steve Jung said:Well, not at the moment.
Can you break it down more simply?