Purchase Solution

Analyzing an Algorithm for Assignment Statements

Not what you're looking for?

Ask Custom Question

For the following algorithm find the number of times the assignment statement (:=) is executed during the running of the program. Answer the question by giving a formula in terms of n:

i := 1;
while i < n + 1 do
i := i + 2;
for j := 1 to i do S od
od

Purchase this Solution
Solution Summary

The solution finds the number of times the assignment statement is executed during the running of the program.

Solution Preview

Solution:
Assume the number of times is m.

From i:=1 we can get the number of time for this part is 1;

From i:=i+2 we ...

Purchase this Solution
Free BrainMass Quizzes
Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.

Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.

Probability Quiz

Some questions on probability

Know Your Linear Equations

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.

Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.

View More Free Quizzes
Related BrainMass Solutions

  • Analyzing an Algorithm for Addition Operations

    32323 Analyzing an Algorithm for Addition Operations Trace the algorithm below and track the number of times that the addition operation (+) is executed over the course of the program's run time.

  • Median Finding Algorithm for Joint Databases

    73583 Median Finding Algorithm for Joint Databases You are interested in analyzing some hard to obtain data from two separate databases.

  • Sales, Probability, Forecasting Models, EOQ, Programming

    Which of the following statements is true comparing the transportation and assignment algorithms to the simplex algorithm? a. Similar computational effort, faster, and similar computer memory usage b.

  • Explanation of how to make an algorithm more efficient

    This solution takes an n-squared algorithm for finding the two closest elements in an array and shows how that algorithm can be converted to a much faster algorithm.

  • Analyzing algorithm complexity

    276239 Analyzing Algorithm Complexity Suppose you are given an array A of n sorted numbers that has been circularly shifted k positions to the right.

  • Numerical Analysis Problem Using Matlab

    The pdf file contains the explanations on the approximation of pi in this assignment. The Matlab file contains the application of the Romberg algorithm. This provides an example of using Romberg algorithm to approximate an integral in Matlab

  • Running time of a set union implementation

    Minimum number of algorithm assignments to set3 array = total number of elements in set2 = size2 This happens when all the elements of set1 are found in set2, so no assignment happens in nested for loop.

  • Pseudocode for a Simple Task such as Turkey Sandwich.

    an if conditional statement, a for loop and a while loop with their conditional statements have been used to make simple turkey sandwich.

  • Execution of Binary Search Algorithm

    ,sj (j >= i >= 1) sorted in nondecreasing order, a value key, i, and j Output: The output is an index k for which sk = key, or if key is not in the sequence, the output is the value 0.

View More Related Solutions