Big-O Coding Exercise Show your solution and explanations. Problem 6 def oneloop (n): while n != 1: n = math.floor(n/2) print (n) For the following snippets of code perform the following Find the function for the number of steps the algorithm performs. To what Big-O set will this algorithm belong to? In other words what is the complexity algorithm? Since n usually refers to input size you may assume it is a positive integer.

Big-O Coding Exercise Show your solution and explanations. Problem 6 def oneloop (n): while n != 1: n = math.floor(n/2) print (n) For the following snippets of code perform the following Find the function for the number of steps the algorithm performs. To what Big-O set will this algorithm belong to? In other words what is the complexity algorithm? Since n usually refers to input size you may assume it is a positive integer.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 18SA

See similar textbooks

Similar questions

Determine the function for the number of steps taken by the algorithm.Which Big-O set will this algorithm belong to? In other words, determine the complexity of this algorithm Because n usually refers to the size of the input, you can assume it is a positive integer.
Consider a divide-and-conquer algorithm that calculates the sum of all elements in a set of n numbers by dividing the set into two sets of n/2 numbers each, finding the sum of each of the two subsets recursively, and then adding the result. What is the recurrence relation for the number of operations required for this algorithm? Answer is f(n) = 2 f(n/2) + 1. Please show why this is the case.
For relatively small values of n, algorithms with larger orders can be more efficient than algorithms with smaller orders. Use a graphing calculator or computer to answer this question. For what values of n is an algorithm that requires n operations more efficient than an algorithm that requires [50 log2(n)] operations? (Assume n is an integer such that n > 1.) n?
Answer the ff: questions: 1. What is the special case called for the lecture implementation of bucket sort with only one bucket? A. Average Case Bucket Sort B. Worst Cake Bucket Sort C. Q-tip Sort D. Insertion Sort 2. Big O is used to denote an upper bound for a function in the coding sense and NOT the mathematical sense. A. TrueB. False 3. Using the definition of Big O notation, what is O(n)? A. A function with a dominating linear term and possibly some additive constants B.A complexity with the dominating term being equal to n C. A linearly scaling algorithm D. A set of positive functions less than or equal to cn; with c being some positive integer 4. The Big O complexity of a given algorithm changes with respect to n. A. True B. False
To what Big-O set will this algorithm belong to? In other words, what is the complexity of this algorithm? Briefly explain why you came up with your answer. Note: Since n usually refers to input size, you may assume it is a positive integer. The ellipsis (...) indicates a repetition until the pattern is finished.
Q10. Consider the following algorithm: g1 = 7 g2 = 6 For k starting at 3 and ending with 8: gk = (k-1)·gk-1 + gk-2 What is the last term, g8, of the recursive sequence generated as a result of executing this algorithm?
Consider the following non-recursive algorithm: Algorithm Euclid2(m, n)//Input: Integers m and n where m >=n//Output: Greatest Common Divisor of m and nwhile n ≠ 0 do r ← m mod n m← n n ← r return m a) What does this algorithm compute?b) What is the input size for this algorithm?c) What is the basic operation of this algorithm?d) How many times the basic operation is executed worst case scenario?e) How many times the basic operation is executed in best-case scenario?
You will analyze three algorithms to solve the maximum contiguous subsequence sum problem, and then evaluate the performance of instructor-supplied implementations of those three algorithms. You will compare your theoretical results to your actual results in a written report. What is the maximum contiguous subsequence sum problem? Given a sequence of integers A1, A2, ..., An (where the integers may be positive or negative), find a subsequence Aj, ... , Ak that has the maximum value of all possible subsequences. The maximum contiguous subsequence sum is defined to be zero if all of the integers in the sequence are negative. Consider the sequence shown below. A1: -2 A2: 11 A3: -4 A4: 13 A5: -5 A6: 2 The maximum contiguous subsequence sum is 20, representing the contiguous subsequence in positions 2, 3, and 4 (i.e. 11 + (-4) + 13 = 20). The sum of the values in all other contiguous subsequences is less than or equal to 20. Consider a second sequence, shown below. A1: 1…
Modeling the spread of a virus like COVID-19 using recursion. Let N = total population (assumed constant, disregarding deaths, births, immigration, and emigration). S n = number who are susceptible to the disease at time n (n is in weeks). I n = number who are infected (and contagious) at time n. R n = number who are recovered (and not contagiuous) at time n. The total population is divided between these three groups: N = S n + I n + R n There are several hidden assumptions here that may or may not apply to COVID-19, such as a recovered person is assumed to not be able to get the disease a second time, at least within the time window being examined. On week 0 (the start), you assume a certain small number of people have the infection (just to get things going). Everyone else is initially susceptible, and no one is recovered. There are two constants of interest: Let period = time period that it takes for an infected person to recover (recover meaning they become not infectious to…
A computer science student designed two candidate algorithms for a problem while working on his part-time job The time complexity of these two algorithms are?1(?) = 3 ? log ? and ?2(?) = ?6/5. a) Which algorithm is better? Why?b) If we run both algorithms at the same time with an input size of 105, which algorithm produces results faster than the other one? Why?
Consider a scenario in which you are presented with a data set of length K. Write a simple recursive algorithm to choose all possible pairs of elements in the set. Assess the computational complexity and explain your calculations.
Consider the following non-recursive algorithm:Algorithm Euclid2(m, n)//Input: Integers m and n where m >=n//Output: Greatest Common Divisor of m and nwhile n ≠ 0 do r ← m mod n m← n n ← r return ma) What does this algorithm compute?b) What is the input size for this algorithm?c) What is the basic operation of this algorithm?d) How many times the basic operation is executed worst case scenario?e) How many times the basic operation is executed in best-case scenario?