In a previous post, (here), I presented a fast way to compute 2^x, what about a^b , or Math.pow(a,b), can we create an alternate faster method ? Math.pow(a,b) = a^b = e^(log(a^b)) = e^(log(a)*b) we have a fast version of Math.log and a fast Math.exp (here) We can combine both functions to get our Math.pow(a,b): […]

~ read more ~## Posts tagged ieee

# Math.log tricks **updated**

I presented ways to optimize log10(i) (log10), log2(i) (log2(n), what about a faster Math.log for Numbers ? Lets start with a log2(N:number), when a number is written as a ieee-754 numbers, we can read directly the exponent of the number. with alchemy, we can alias our number as an integer, and extract the exp. In […]

~ read more ~# Math.exp Math.pow(2,x) 2^x optimizations and tricks , **updated **

In my previous posts, I presented optimizations for e bunch of Maths functions, so lets continue and see whats next in the list ! Today I am going to explore ways to optimize Math.pow(2,x) or 2^x , as well as Math.exp One easy trick to fast perform 2^i for integers is to use bit shifting, […]

~ read more ~# reciprocal 1/x tricks **updated**

Can we fast compute 1.0/x ? static public function recriprocal( value:Number ):Number { return 1.0/value; } So here some ideas, we already have a fast way to compute 1/sqrt(x), if you look at 1/x and 1/sqrt(x) , you will notice that both equations are pretty close, so it gives us a pretty good “first guess”. […]

~ read more ~# Fastest way to sort Numbers ?

Let’s beat the Array.sort for Numbers, lets beat the best as3 implementation of quicksort and lets beat about any AS3 sorting function you have seen so far. Here 2 really fast algorithms to sort floats (or Numbers), FlashSort and Radix ! FlashSort I presented in an earlier post a really fast flashSort implementation for Integers […]

~ read more ~
## Recent Comments