For each of the following three program fragments: a. Give an analysis of the running time (Big-Oh will do). b. Implement the code in the language of your choice, and give the running time for several values of N (100, 500, 1000, 5000). c. Compare your analysis with the actual running times. (1) sum = 0; for( i = 0; i < n; ++i )++sum; (2) sum = 0; for( i = 0; i < n; ++i ) for( j = 0; j < n * n; ++j ) ++sum; (3) sum = 0; for( i = 0; i < n; ++i ) for( j = 0; j < i * i; ++j ) for( k = 0; k < j; ++k ) ++sum;

For each of the following three program fragments: a. Give an analysis of the running time (Big-Oh will do). b. Implement the code in the language of your choice, and give the running time for several values of N (100, 500, 1000, 5000). c. Compare your analysis with the actual running times. (1) sum = 0; for( i = 0; i < n; ++i )++sum; (2) sum = 0; for( i = 0; i < n; ++i ) for( j = 0; j < n * n; ++j ) ++sum; (3) sum = 0; for( i = 0; i < n; ++i ) for( j = 0; j < i * i; ++j ) for( k = 0; k < j; ++k ) ++sum;

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter5: Repetition Statements

Section5.5: A Closer Look: Loop Programming Techniques

Problem 12E: (Program) Write a program that tests the effectiveness of the rand() library function. Start by...

See similar textbooks

Similar questions

Complete the whole code a..
Write a python function that takes one integer (n) parameter and prints the first n digits from the Fibonacci series using recursion.Sample input: 5Sample output: 0, 1, 1, 2, 3 Write a function that takes one integer parameter, makes sure it is an integer, prints sum of every two digits and return the sum of digits from the number entered by the user up to 1, using recursion.Sample input: 4 Sample output: 4+3 = 77+2 = 99+1 = 10
In C++ Just answer the questions in simple code please. Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms. Do this in a function called Sierra.
language: Python Problem: Write a function log2(x), which gives an integer approximation of the log base 2 of a positive number x, but it does so using recursion. Use a base case where you return 0 if x is 1 or less. In the general case, add 1 to the answer and divide x by 2. On top of writing the function, also write a test case for the function to prove the program works.
The topic is Fixed - point iteration method from Numerical Methods.Task:Create a program that uses C language that solves the function below:f(x) = 3x = ex The program should be able to ask the user for the initialization and check it.
Write a program that asks the user to enter a binary string and you must use this binary string as an input to your functions. These functions that are to be created will be recursive functions that return the decimal number equivalent of your binary string input. For this exercise, you will develop 2 different ways of solving this problem: • Implementation 1: A recursive function with two inputs: a binary string, and a number. (Hint: You can think of this number as the index that allows you to access each element in your sequence.) • Implementation 2: A recursive function with only one input: the binary string. Conditions: Do implementation 1 if the binary string starts with a '0'. Otherwise, do implementation 2 if the binary string starts with '1'. Before you return a value in your recursive function's base case, print a statement that reveals the identity of the function that is currently being used.
Write an application that solves a system of linear equations. Have the user input the coefficients of the two lines. Remember that the definition of a line is: Ax + By = C. The program should output the intersection of the two lines if they do indeed intersect, indicate if the two lines are parallel, or if they are the same line. using c++ and arrays.
An arithmetic sequence is a sequence of values where successive values have a common difference. For example, 2,5,8,11,... is an arithmetic sequence starting at 2 with a common difference of 3. We call the starting point s and the difference d. Fill in the missing lines below to write a recursive Python function called arithmetic that takes values for s, d, and n, and returns the nth term of the arithmetic sequence. For example, given the main function: def main(): for i in range(1,6): print(arithmetic(2,3,i)) the output will be: 2 5 8 11 14 Note: No marks will be given for a non-recursive solution. Code with missing lines: # Line 1 # Line 2 # Line 3 # Line 4 # Line 5 Matching each line of code below to its proper line number (Line 1 to Line 5), indicated in the partial code above, to solve the problem. Some lines of code will not be used at all; for these you would select option 6 (i.e., Not Used) from the list of options - do not leave these blank. Question 8 options:…
(Program) Write a program that tests the effectiveness of the rand() library function. Start by initializing 10 counters, such as zerocount, onecount, twocount, and so forth, to 0. Then generate a large number of pseudorandom integers between 0 and 9. Each time 0 occurs, increment zerocount; when 1 occurs, increment onecount; and so on. Finally, display the number of 0s, 1s, 2s, and so on that occurred and the percentage of time they occurred.
The topic is Bisection Method from Numerical Methods.Task:Create a program that uses C language that solves the function below:f(x) = 3x = ex The program should be able to ask the user for the initialization and check it.
With c programming and without pointer and function Harry and Larry are now bored playing with numbers. Now they want to play with plus and minus signs. This time they don’t want to give signs one by one. Anyone can give any number of signs at a time but at most N signs. Can you tell the maximum of all signs that they gave sequentially? For example: If the input is 7 + + - + - - - , then the answer is 3 as 3 minus signs are given sequentially and it is the maximum. If the input is 7 + + + + + - - , then the answer is 5. Input Format First line will contain a positive integer N Second line will contain N signs (+ or -) Constraints 0 < N <= 100 Output Format Output a single integer, the maximum of all signs that came sequentially. Sample Input 0 7++++--- Sample Output 0 4
Give write code with implementation of code