I have an algorithm that runs in O(N 1/2 ), where n is the size of the problem. For N = 100, the time the algorithm runs is 1 minute. How long does the algorithm take for N=1000?
a) Same time
b) About 3 minutes
c) About 10 minutes
d) About 30 minutes
e) You haven’t given enough information. I can’t tell.
```
new_time = old_time*(1000 1/2 )/(100 1/2 )=10 1/2 ,about 3 minutes.
```
Computer Science & Information Technology
You might also like to view...
You would use sector to divide your presentation content into meaningful groups of slides
Indicate whether the statement is true or false
Computer Science & Information Technology
Joe, a network technician, is tasked with installing a router and firewall to get an office working with internet access. Which of the following features MUST be configured to allow sharing of a single public IP address?
A) POP3 B) QoS C) SMTP D) PAT
Computer Science & Information Technology