x
Info
x
Warning
x
Danger
 / 
 / 
 / 
Question Suppose that an algorithm takes 30 seconds for an input

Question : Question Suppose that an algorithm takes 30 seconds for an input : 916651

Question

Suppose that an algorithm takes 30 seconds for an input of 224 elements (with some particular, but unspecified speed in instructions per second). Estimate how long the same algorithm, running on the same hardware, would take if the input contained 230 elements, and that the algorithm's complexity function is: Big theta not Big O

a) Big theta(N)

b) Big theta (log N)

c) Big theta (N log N)

d) Big theta(N^2)

Assume that the low-order terms of the complexity functions are insignificant, and state your answers in the form HH:MM:SS.S (hours, minutes, seconds, tenths of a second). Be sure to show supporting work.

 

Solution
5 (1 Ratings )

Solved
Computer Science 1 Week Ago 29 Views
This Question has Been Answered!

Related Answers
Unlimited Access Free
Explore More than 2 Million+
  • Textbook Solutions
  • Flashcards
  • Homework Answers
  • Documents
Signup for Instant Access!
Ask an Expert
Our Experts can answer your tough homework and study questions
154220 Computer Science Questions Answered!
Post a Question