Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Could someone please explain why is addition operation faster than multiplication operation ?
for example if we need to multiply 25 by 50
will the compiler transform it to a for loop of additions ?
Multiplication is a much more complex process, requiring more silicon either as a multiplier circuit or in a lookup table in order to reach the same level of performance as provided by addition.