dcsimg
Login | Register   
RSS Feed
Download our iPhone app
TODAY'S HEADLINES  |   ARTICLE ARCHIVE  |   FORUMS  |   TIP BANK
Browse DevX
Sign up for e-mail newsletters from DevX

By submitting your information, you agree that devx.com may send you DevX offers via email, phone and text message, as well as email offers about other products and services that DevX believes may be of interest to you. DevX will process your information in accordance with the Quinstreet Privacy Policy.


Tip of the Day
Home » Tip Bank » C++
Language: C++
Expertise: Beginner
Jul 26, 2002

WEBINAR:

On-Demand

Application Security Testing: An Integral Part of DevOps


A Fast Multiplication Method for Integer Numbers


The multiplication operation for integer numbers is implemented in the processor as repeated additions. The number of additions can be reduced by considering the representation in base 2 of the multiplier, as in this example:
 
int i = 111;
//We need to compute int j = i * 15; but 15 = 1 + 2 + 4 + 8 
= 2^0 + 2^1 +
2^2 + 2^3,
//so we can reduce the multiplication to some shift operations 
and just 3 additions

int j = i + (I<<1) + (I<<2) + (I<<3);

If you have multiplications in some lengthy iterative loops, using this trick can substantially increase CPU saving.
George Anescu
 
Comment and Contribute

 

 

 

 

 


(Maximum characters: 1200). You have 1200 characters left.

 

 

Sitemap
Thanks for your registration, follow us on our social networks to keep up-to-date