Explore BrainMass
Share

# Analying the algorithmic complexity of arithmetic operations

This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!

Use big-O notation to classify the traditional grade school algorithms for addition and multiplication. That is, if asked to add two numbers each having N digits, how many individual additions must be performed? If asked to multiply two N-digit numbers, how many individual multiplications are required?

© BrainMass Inc. brainmass.com March 21, 2019, 6:15 pm ad1c9bdddf
https://brainmass.com/computer-science/algorithms/analying-the-algorithmic-complexity-of-arithmetic-operations-250753

#### Solution Preview

Adding two n-digit numbers is an O(n) operation. Considering the following problem:

abc
+def
------

In order to add these numbers the following individual operations must be ...

#### Solution Summary

This solution examines two common arithmetic operations, addition and multiplication, from the perspective of Computer Science algorithms. It then describes and explains the complexity of the algorithms in big-o notation.

\$2.19