Question: Using Java, Consider the following loop construct: X := 1 repeat Y := N while Y > 0 do . . . // something (the
Using Java, Consider the following loop construct: X := 1 repeat Y := N while Y > 0 do . . . // something (the ellipsis) Y := Y - 1 endwhile X := X + X until X > N * N Categorize its efficiency in terms of the variable N using big-O notation. Also, assume that the statements represented by the ellipsis require four main memory accesses with each access requiring 1 microsecond, and two disk file accesses with each requiring 1 millisecond. Express in milliseconds the amount of time this construct would require to execute if N = 1000.
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
