Hi Sven. Using '((self + upper) / 2 ) truncated' seems to be a little bit faster than 'self + upper bitshift: -1'.
Thierry 2016-05-24 9:57 GMT+02:00 Sven Van Caekenberghe <s...@stfx.eu>: > I just published a short, introduction level article, > > Speeding up factorial computation by changing the order of multiplications. > > This is a story about a small, seemingly innocent code change that speeds > up a very simple computation. It is pretty magical and serves as an example > of how things are not always what they seem. > > > https://medium.com/concerning-pharo/speeding-up-factorial-computation-by-changing-the-order-of-multiplications-f4da3a5576da#.l3nrk9oax > > Enjoy, > > Sven > > -- > Sven Van Caekenberghe > Proudly supporting Pharo > http://pharo.org > http://association.pharo.org > http://consortium.pharo.org > > > > > >
