I have an algorithm that runs in O(N1/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*(10001/2)/(1001/2)=101/2 ,about 3 minutes.
```
Computer Science & Information Technology
You might also like to view...
A ____ dotted underline indicates the text may be incorrect grammatically.
A. red B. green C. blue D. purple
Computer Science & Information Technology
Typefaces are divided into two categories: sans serif and ________
Fill in the blank(s) with correct word
Computer Science & Information Technology
The Graphic Interchange Format is supported by Windows Photo Gallery
Indicate whether the statement is true or false
Computer Science & Information Technology
To print an envelope, insert an envelope in your printer, and then click Print.
Answer the following statement true (T) or false (F)
Computer Science & Information Technology