Purchase Solution

Analying the algorithmic complexity of arithmetic operations

Not what you're looking for?

Ask Custom Question

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?

Purchase this Solution
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.

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 ...

Purchase this Solution
Free BrainMass Quizzes
Word 2010: Tables

Have you never worked with Tables in Word 2010? Maybe it has been a while since you have used a Table in Word and you need to brush up on your skills. Several keywords and popular options are discussed as you go through this quiz.

C# variables and classes

This quiz contains questions about C# classes and variables.

Basic UNIX commands

Use this quiz to check your knowledge of a few common UNIX commands. The quiz covers some of the most essential UNIX commands and their basic usage. If you can pass this quiz then you are clearly on your way to becoming an effective UNIX command line user.

Excel Introductory Quiz

This quiz tests your knowledge of basics of MS-Excel.

Basic Computer Terms

We use many basic terms like bit, pixel in our usual conversations about computers. Are we aware of what these mean? This little quiz is an attempt towards discovering that.

View More Free Quizzes
Related BrainMass Solutions

  • String function evaluation and algorithm analysis

    The second part provides a detailed explanation of the algorithmic complexity of the addition and multiplication algorithms.

  • Software Design Alternatives

    ., "principle of least surprise" Advantages of Algorithmic Design -------------------------------------- Reasonably well-suited for small-scale, algorithmic-intensive programs, e.g., Eight-Queens problem, Towers of Hanoi, 8-tiles problem, sort,

  • Analyzing algorithm complexity

    Even with the optimization the time complexity is still O(n). This solutions explains two algorithms for manipulating values in a list and explains the algorithmic complexity of each algorithm.

  • Fibonacci Number Visual C++ Recursion Iteration Runtime

    I have also added "Fibonacci time comparison.doc" which explains in algorithmic terms the comarison in CPU time/number of operations. Please see the mentioned reference which tells a lot more in detail.

  • Recurrence equations for Quicksort

    T(i) = (i-1) + S(i)/n : Computation of T(i) requires one array lookup for S(i), one division, one subtraction and one addition. Thus each computation of T(i) requires 3 array lookups and 5 arithmetic operations irrespective of the value of i.

  • List of 3 problems that might be raised at home/business

    The expert lists the three problems that might be raised at home, business, etc. Algorithmic or heuristic solutions are examined.

  • Describing Algorithms

    Print the result in affirmative or negative, depending on the value of the Boolean variable. This step is O(1). Therefore, the maximum time-complexity of this algorithm is O(n).

  • Order of arithmetic operations

    241467 Order of Arithmetic Operations Evaluate the following expression exactly: 9876543210 ---------------------------------------------------------------

  • Redundant Data

    Elimination of redundant data in terms of Hardware and Algorithmic approaches (software) is discussed.

View More Related Solutions