Answered: What is the Big Oh runtime for the…

What is the Big Oh runtime for the following function in terms of n? Show your work. int recurse(int n) { if (n == 0) return 1; int x = 1; while (x < n) { x = (x << 1); } return x + recurse(n - 1) }

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

Related questions

Q: What does .compare do in c++? for example in this sorting function void employeeSort(string…

A: Compare: “compare()” function is one of in-built function that is used to compare the strings. It…

Q: Using a source-level debugger, determine for what values of argumentsthe function Mystery returns a…

A: Given a code, To check for what values of a, b, and c the function Mystery returns 0.

Q: Suppose s is "\tGeorgia\n". What is s.lower() and s.upper()?

A: s.lower() on object 's' returns a new string in lowercase s.upper() on the object 's' to return a…

Q: What is the big-O notation for the worst-case runtime of the code fragment below? for (i = 0; i < N;…

A: In the Above Code The For loop will run n/2 times but it will be written as O(n) Big O time…

Q: Arrange the following fuinctions in ascending order of growth rate. is, if function g(n) immediately…

A: Given functions worst case time complexities are:…

Q: Consider the function below written in Python3: def foo(a, b=[1]): if a 0 and assuming n is the…

A: In computer sciences and technology, the big O notions is very helpful in order to classify the…

Q: In this question, we are going to write a Racket function wordMaxIndex that calculates the maximum…

A: Hey there, I am writing the required solution of the above stated question.Please do find the…

Q: Complete the below function which takes the coefficients of a polynomial P(x) as a tuple, and a list…

A: #function def polynomial(coefficients, values): #list to store computed values of P(x)…

Q: def function(n): while n>0: n=(n/2) can n be ever equal to 0? What is the time complexity of this…

A: I it time related to time complexity analsis Taking simple example value for n and testing for few…

Q: You are given a int[] containing a list of non-negative integers. Find and return the largest one…

A: Let's understand step by step : 1. Declare an array a[] which is an input. 2. Call function find()…

Q: Program in python There is function F Give an integer n (n 2 2), consider the prime factorization…

A: python code is given below

Q: Consider the following program fragment, which has a time complexity that is a function of n. What…

A: We need to find the o big notation of the function. see below steps for answer

Q: 1: foo 0 2: for i0 to n do foo foo × 4 3:

A: Given :- Analyze the following code fragment and provide an asymptotic (Θ) bound on the running time…

Q: Arrange these functions in a list so that each function is big-O of the next function a) Vn, 1000…

A: arrangement of function as per time complexity is given in step 2.

Q: Consider the function below written in Python3: def foo(a, b=[1]): if a 0 and assuming n is the…

A: What follows is the first legal tree for a given relationship of multiplication. If we tend to…

Q: Describe the worst case running time of the following code in Big-O notation in terms of variable n.…

A: With our restricting guidelines, we are allowed to answer the first question only. - The question…

Q: My question is can I write this code in a different and easier way .? Python code: # there is only…

A: The easier presentation of given Python code: def fn(x): return x**3 - x - 2 # define…

Q: The exercise description says to use 1, 10 and 20 for the values of k. These should be 1, 11 and 21…

A: Here are some imports missing that are required to execute this code. They are as follows:from…

Q: T (n) is taken as the ground state T (1) = 10. For numbers back to T (n + 1) = 2n + T (n), n> = 1.…

A: T (n) is taken as the ground state T (1) = 10. For numbers back to T (n + 1) = 2n + T (n), n> =…

Q: why is my output being flipped in this rather than how the example shows in javascript the…

A: Solution:-- 1)The given question has required for the solution which is to be provided in the…

Q: void transfer(Entry[ ] newTable) { Entry[ ] src = table; int newCapacity = newTable.length; for (int…

A: void transfer(Entry[ ] newTable) {Entry[ ] src = table;int newCapacity = newTable.length;for (int j…

Q: What is the Big-Oh Runtime (in terms of n) for the following segment of code? int i; int used[n];…

A: Generally, we define the complexity of any code by using Big O- Notation. The complexity depends…

Q: Develop Python Code for the following scenarios: Given a list L having N numbers and Q set of…

A: The answer for the above mentioned question is given in the below steps for your reference.

Q: What is the (worst case) time complexity of the following find function, which searches for a key in…

A: The recursive relation of given code T(n) = T(n-1) + K = T(n-2) + K +K = T(n-3) + K…

Q: Given the following function: def F1(n): k=0 for i in range (1, (n*n*n*n)/2): for j in range(0, i):…

A: NOTE - both images are of same question Time complexity will be the number of times the statement (…

Q: What is the order of growth of the worst-case running time of the following code fragment as a…

A: Since you have asked multiple questions, we will solve the first question for you. If you want any…

Q: Consider the following function: def foo(m): INF = 1000000 def bar(m, lx, ly, n): if n == 1: return…

A: In the given program, the function foo is defined. Inside the function foo, bar function is defined.…

Q: c. void squire (int n) { if( n <= 1 ) time++; else { squire (n/2); squire (n/2); for (int i=0; i<n;…

A: complexity for loop inside else part is calculated then recurrance relation is framed and then…

Q: def foo(m): INF - 1000000 def bar(m, 1x, ly, n): if n =- 1: return m[1x][1y] if n =- 0: return -INF…

A: We have to debug and analysis this block of code which is function defined with recursive calls. As…

Q: Q1. Analyze the time complexity for following code segments/ functions. i. 1. int count = 0; 2. for…

A: Given:

Q: Given: Consider the function below written in Python3: def foo(a, b=[1]): if a 0 and assuming n is…

A: Explanation: A function foo with variables a and b is included in the given code. Loops in iterative…

Q: Consider the function fun :: Num a => [a] -> [a] fun (x.y:xs) = (x + y): (fun (y:xs)) fun _ = 0…

Q: What is the worst-case (Big-O) time analysis for the following code: float sum(float list[], int n)…

A: Answer : As according to given loop i variable run till n . so it simply the time complexity will be…

Q: Order the following functions in increasing order of growth rate (i.e. O(.) classes). log n log log…

A: Increasing order of growth rate

Q: Consider the following recursively defined function (in Lean): def foo : ℕ → ℕ | 0 := 1 | 1 := 0 |…

A: Consider the following recursively defined function (in Lean):def foo : ℕ → ℕ| 0 := 1| 1 := 0| (succ…

Q: The following function has worst case memory usage proportional to : def posfactorslist(n): Ist [] i…

A: Solution: Given,

Q: • For each of the following pairs of functions, either f(n) is O(g(n)), f(n) is Q(g(n)), or f(n) =…

A: The fundamental thought of asymptotic examination is to have a proportion of the effectiveness of…

Q: For each of the functions f(N) given below, indicate the tightest bound possible (in other words,…

A: So let's solve each part: 1. The addition and subtraction rule says that , take the greatest time…

Q: program is given below attachment

A: a. The returned value of fib(5) will be: 0 1 1 2 3 b. Recurrence relation for T(n): T(n - 1) + T(n -…

Q: Suppose we have the following functions: n log n, n² log n, logn Which order of the functions so…

A: - We need to have a correct choice for asymptomatic functions. - The functions :: n log n, n2 log n,…

Q: [ ]: # write your implementation here def isPrime(n): checks whether the positive integer n, which…

A: here in this question we have asked to write a program which take input from user and check for…

Q: Develop Python Code for the following scenarios: Given a list L having N numbers and Q set of…

A: As per the above listed problem statement we are required to develop python code to find out the…

Q: As we in general, try to solve the problem first; we start with a brute force, simple, algorithm:…

A: Coded using Python 3.

Q: What value is returned by the following function? Express your answer as a function of n. Give the…

A: GIven funtionfunction mystery(n) r = 0 for i in 1 to n - 1 do for j in 1 to n do…

Q: What is the running time of the piece of code below? c = 1 For i = 1,2, ..., n: For j n/2,..., n:…

A: For the question: C)option is the correct

Q: Write a program that takes an integer N and uses the function “np.random.randint(low = 0, high = N)”…

A: As n increases the absolute difference decreases, which is proved by induction over multiple…

Q: If P(x) is a polynomial in x with integer coefficients, let W(P(x)) = number of odd %3D coefficients…

A: Procedure: We have the 2 input Input1 and Input2 from the user use these input defines on the…

Q: Consider 3 ,5, 8 , 10 , 5, 2,1,7,3, 13 as an input to the list of n integers. Dry run the following…

A: A procedure named func accepts a list of n integers and returns value of k. Given list of integers:…

Concept explainers

Hiring problem

The term "hire" means "to employ" or "to obtain services for a fee." When you hire someone, you are employing or paying them to perform a certain task for you. A step-by-step method for hiring a new employee is an efficient and successful hiring process in which a business determines its talent needs, recruits from its talent pool, and hires the best-qualified individuals. The hiring problem is a well-known decision-making problem in the analysis of algorithms. The problem is solved by designing an efficient algorithm to choose the best candidate from a list of n candidates.

Question

What is the Big Oh runtime for the following function in terms of n? Show your work.

int recurse(int n) {

if (n == 0)

return 1;

int x = 1;

while (x < n) {

x = (x << 1);

}

return x + recurse(n - 1)

}

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Consider the function, f(n), defined by the following code int f(int n) { int r = 0; if ( n % 2 == 0 ) return 1; // when n is even while ( n > 1 ) { n = n – 3; r++; } return r; } From the definitions of big-Theta and little-oh: Prove or disprove that f(n) is Θ ( n ) 2. Prove or disprove that f(n) is o ( n^2 ) ( note: function f(n) as defined by the code, that is, the return value, and is not asking about the runtime of the code.)
What is the value returned by the following function? Express your answer as a function of n. Give, using big-O notation, the worst-case running time. function pesky(n) 1. r := 0; 2. for i := 1 to n do 3. for j := 1 to i do 4. for k := j to i + j do 5. r := r + 1 6. return(r)
a) Implement a function start( ) that takes as input a positive number a, rounds its logarithm base 4 to the nearest integer n, and returns the value of 1.0 x 2^n.
How can the following function be simplified so that it has a time complexity of O(n) or faster?For your information, the specifications of the functions are as follows: Using numbers ranging from 0 to 15 (inclusive), create all possible lists which sum up to K and have a length of N. Duplicated numbers are allowed as long as it fulfills the conditions above (this means [0,0,1], [0,1,0] and [1,0,0] are all correct outputs if K=1 and N=3). When instantiated with the list function, the list size of the function should be the number of all lists. For example, given K=23 and N=2, the expected list size is 8. The function must be able to accept N=10 and be finished before 9 seconds. Do not use itertools or external libraries.
In this question, we are going to write a Racket functionwordMaxIndex that calculates the maximum index of each word thatappears in an input word list. For example, if the input is’(time is long but life is short)Then one output can be((time 0) (long 2) (but 3) (life 4) (is 5) (short 6))The index of the first word in a word list is 0; the index for the secondword is 1; etc. Therefore, in the previous example, the maximum indexfor word “time” is 0; the maximum index for word “is” is 5, since “is”appears twice, at index 1 and 5. Note that you are not asked to sortthe words in the output. Therefore, the output is correct as long asthe indexes are correct.Do the following steps to implement the word-index program. In ourdiscussion, we call a word with an index a word-index pair, for example,(short 6) and (is 5) are word-index pairs. We call a list of word-index pairs a word-index list.(a) Write a function initialWIList that takes a list ofwords and creates a word-index list. The resulting…
What is the Big-Oh Runtime (in terms of n) for the following segment of code? int i; int used[n]; for (i = 0; i < n; i++) { used[i] = 0; } for (i = 0; i < n; i++) { if (used[i] == 0) { used[i] = 1; i = -1; } }
Write a function triple_riffle_repeat(mylist,n) which takes as input a list (again with length a multiple of 3) and outputs the result of doing a 3-way riffle shufffle n times Write a function period(m) which takes as input a number m (which we will always take as a multiple of 3) and outputs the smallest positive integer n so that triple_riffle_repeat(list(range(m)),n) == list(range(m)) Discuss, with evidence, the outputs of your function period for different values of m, writing your answer as a comment.
Write a program that takes an integer N and uses the function “np.random.randint(low = 0, high = N)” to generate a random sequence of integers between 0 and N-1. Run experiments to validate the hypothesis that the number of integers generated before the first repeated value is found is “~sqrt(pi * N / 2)”. please help with last part Show that as n increases (e.g. with a doubling experiment), from n = 2 to n = 1,000, the value of “day_sim(n)” approaches “sqrt(pi * n / 2)”.
Identify the big-O time complexity of each of the following functions:void f1(int n) {for(int i=0; i<(3*n+n); ++i) {cout << i << endl;}for(int i=0; i<(10*n); ++i) {cout << i << endl;}}void f2(int n) {if(n==0) { return; }f2(n-1);f2(n-3);}void f3(int n) {for(int i=0; i<n; ++i) {for(int j=0; j<n; ++j) {for(int k=0; k<n; ++k) {cout << i << endl;}}}}
Consider the following recursively defined function (in Lean):def foo : ℕ → ℕ| 0 := 1| 1 := 0| (succ (succ n)) := succ (succ (foo n))Can you describe what the function is doing in one short sentence? Which of the following propositions about foo are provable in Lean? For which ones can we prove their negation? Justify your answers.i) ∀ y:ℕ, ∃ x:ℕ, y = foo xii) ∀ x:ℕ, foo (foo x) = xiii) ∀ x : ℕ, foo (succ x) = succ (foo x)iv) ∃ x:ℕ, foo x = x
Please show detailed explanation. Thanks. What is the order of n, O(f(n)) of the following function? n3+50n2+n What is the order of n, O(f(n)) of the following function? 2n+2n3+5n Suppose an algorithm takes exactly the given number of statements for each value below, in terms of the size of n, i.e., the order of n, O(f(n)). n2+logn+2n
(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.