asdf forums

So I got all the things working and I'm posting the game in the games section! It's beta so... yay, also it's a class project from like 2 years ago so it's still WIP with some updates inbound over the next whenever.

My day in a nutshell:
fracking quaternions, how do they work?

guys make an android app for asdf forums.

Would be hard and tiresome to do though. There's no official API as far as I'm aware, which means you need to install a plugin, which only philtom can do.

There is also a mobile "style" for the forum that the admin can install, as far as I understand it also requires some kind of a plugin to make the server automatically redirect you to the mobile page.

And philtom doesn't really answer our (my?) mails

funny. we should track him down.

It'll be like an episode of The X-Files

An admin may be able to have a style selected based on the browser or OS as conveyed by the request sent by the browser. That shouldn't be too hard, at least in theory.

Sounds reasonable to me, but y'know, I'm not an Admin

I just looked it up. philtom is the only administrator. The other green named people are global moderators. I'm guessing they don't have access to the administration page.

We need to call up Evai to hack the world

Anonymously Famous wrote:I just looked it up. philtom is the only administrator. The other green named people are global moderators. I'm guessing they don't have access to the administration page.

We do have access, but only to some of it. Can't change styles and stuff like that.

atomtengeralattjaro wrote:

Anonymously Famous wrote:I just looked it up. philtom is the only administrator. The other green named people are global moderators. I'm guessing they don't have access to the administration page.

We do have access, but only to some of it. Can't change styles and stuff like that.

Thanks for the clarification.

On the topic of programming:

I never really needed the Fibonacci sequence, the only times I saw code that calculates it was in the context of explaining recursion and other meta coding stuff like that, so I never really thought about how to actually calculate a fibonacci number in a way that makes sense.

Then I saw this funny post on imgur about different coding styles: http://imgur.com/gallery/XOA5O

And my first thought was yeah, sure, I'd just write and be done with it, but that's actually a horrible way to do it.

I wonder what's the best way?
This seems to work perfectly and very fast: (In .NET you need an assembly reference to the System.Numerics library for this to work, otherwise you can't use the BigInteger.)

I compared the results to what Wolfram Alpha gave me and it checks out. Got the 100000th fibonacci number in a little over 600 milliseconds for me (that's a 20899 digit number).

I sent philtom an e-mail

atomtengeralattjaro wrote:On the topic of programming:

I never really needed the Fibonacci sequence, the only times I saw code that calculates it was in the context of explaining recursion and other meta coding stuff like that, so I never really thought about how to actually calculate a fibonacci number in a way that makes sense.

Then I saw this funny post on imgur about different coding styles: http://imgur.com/gallery/XOA5O

And my first thought was yeah, sure, I'd just write

Code: Select all

return x < 3 ? 1 : fibonacci(x - 1) + fibonacci(x - 2);

and be done with it, but that's actually a horrible way to do it.

I wonder what's the best way?
This seems to work perfectly and very fast:

Code: Select all

		public static BigInteger Fibo(int x)
		{
			BigInteger a = 1, b = 0, c = 0;
			for (int i = 1; i <= x; i++)
			{
				c = a + b;
				a = b;
				b = c;
			}
			return c;
		}

(In .NET you need an assembly reference to the System.Numerics library for this to work, otherwise you can't use the BigInteger.)

I compared the results to what Wolfram Alpha gave me and it checks out. Got the 100000th fibonacci number in a little over 600 milliseconds for me (that's a 20899 digit number).

I've normally seen it as an example of recursion. In Python, it's sometimes used as an example of a generator.

atomtengeralattjaro wrote:On the topic of programming:

I never really needed the Fibonacci sequence, the only times I saw code that calculates it was in the context of explaining recursion and other meta coding stuff like that, so I never really thought about how to actually calculate a fibonacci number in a way that makes sense.

Then I saw this funny post on imgur about different coding styles: http://imgur.com/gallery/XOA5O

And my first thought was yeah, sure, I'd just write

Code: Select all

return x < 3 ? 1 : fibonacci(x - 1) + fibonacci(x - 2);

and be done with it, but that's actually a horrible way to do it.

I wonder what's the best way?
This seems to work perfectly and very fast:

Code: Select all

		public static BigInteger Fibo(int x)
		{
			BigInteger a = 1, b = 0, c = 0;
			for (int i = 1; i <= x; i++)
			{
				c = a + b;
				a = b;
				b = c;
			}
			return c;
		}

(In .NET you need an assembly reference to the System.Numerics library for this to work, otherwise you can't use the BigInteger.)

I compared the results to what Wolfram Alpha gave me and it checks out. Got the 100000th fibonacci number in a little over 600 milliseconds for me (that's a 20899 digit number).

Seems like a pretty good way of actually doing it. I can't really think of why you would want to in a real environment though.

Anonymously Famous wrote:I've normally seen it as an example of recursion. In Python, it's sometimes used as an example of a generator.

I know I could probably Google™ this, but can you give an (the?) example?

He hasn't responded

No I hadn't, because I had a busy weekend.

Here's a site that has one:
https://technobeans.wordpress.com/2012/ ... in-python/

I might change it some, but that's about it.

Generators create a list-like sequence dynamically. If it has an end condition, you can even create a list (array) by calling the list function on it.