Analying the algorithmic complexity of arithmetic operations
Not what you're looking for?
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.