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.
```
You might also like to view...
The use of software that enables the physical hardware of a PC to be simulated is referred to as virtualization.
Answer the following statement true (T) or false (F)
Which of the following is true about filegroups?
A. filegroups are only used when there is more than one data file B. there can be only one data file per filegroup C. each database must have a primary filegroup D. multiple data files should be of different sizes for best performance
A(n) ____________________ button is a button that submits the form to the CGI script for processing.
Fill in the blank(s) with the appropriate word(s).
Excel CANNOT format text data
Indicate whether the statement is true or false