Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Give a tight bound on the number of times the z = z + 1 statement is executed. i = n while ( i >

Give a tight bound on the number of times the z = z + 1 statement is executed.

i = n

while ( i > 1 ) {

i = floor(i/2)

z = z + 1

}

Group of answer choices

a. Theta(n)

b. Theta(nlgn)

c. Theta(sqrt(n))

d. Theta( lgn)

e. Theta(1)

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Repairing And Querying Databases Under Aggregate Constraints

Authors: Sergio Flesca ,Filippo Furfaro ,Francesco Parisi

2011th Edition

146141640X, 978-1461416401

More Books

Students also viewed these Databases questions

Question

2. What efforts are countries making to reverse the brain drain?

Answered: 1 week ago

Question

1. How does Kiwi Experience maintain a continual customer focus?

Answered: 1 week ago