Subj : Multiplications faster than bit shifts?
To   : comp.programming
From : Eric Fortier
Date : Sat Jul 09 2005 03:26 pm

Hi all,

I read a post by someone recently, and they asserted that multiplications by
two were faster on recent x86 cpus than simple bit shifts. 

I have a very hard time believing a simple shift would take longer than a
multiplication and wanted to know what you people thought about this. 

Eric Fortier
http://www.tlnewsreader.com

.