Code center > Darwinbots Program Source Code

Binary

<< < (4/4)

Numsgil:
That's funny, I just went and tested it today!

Turns out the little bugger is actually slower than regular square root.  Which blows me away, because this function uses like 3 multiplications and not a whole lot else.

I'm going to go research some more, I'll post back here in a new thread if I find anything interesting.

Numsgil:
Ahaha, here's what I found out:

most compilers (including VB) use some art of the processor specifically built for square rooting.  Result?  Square rooting using sqr(number) is about as fast as you can get.

even doing 1 / sqr(number) is faster than the other ways available.
Probably isn't true on older machines though.

Endy:

--- Quote ---I only offer this up for those who may not know ...
or may not have explored it in detail ...
--- End quote ---

I'll raise my hand for that one. Anything outside of decimal hurts my head.

I probably need to learn at least some binary, with the new operators out there I'm sure this will become important eventually.

The compliment feature ~ already looks like it'll be extremly useful to convert from zero to one (with use of abs) or vice versa, depending on what conditional you need.

PurpleYouko:
I have a database that stores numbers in base 64. It uses 0-9 and the entire alphabet in upper and lower case and a few other characters too. That was a bit freaky to program but it cut down the length of ID codes from about 12 digits to 4  :D

Zelos:
well, that help alot, with that you get 16777216 possible combinations

Navigation

[0] Message Index

[*] Previous page