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. You haven’t given enough information. I can’t tell.
B. About 3 minutes
Computer Science & Information Technology
You might also like to view...
What are some of the settings available in the security options of the local policy?
What will be an ideal response?
Computer Science & Information Technology
By default, block-level elements always appear ____.
A. side-by-side B. stacked one on top of the other C. Either a or b. D. Neither a nor b.
Computer Science & Information Technology
FIGURE EX 7-1
The arrow shown in the accompanying figure is pointing to where you would ____.
A. attach a copy of the workbook to an email B. type a comment C. sign in to Windows Live D. save a file as a PDF
Computer Science & Information Technology
Which of the following is the default line spacing of Word 2016?
A) Single spacing B) Multiple 1.08 spacing C) Multiple 1.5 spacing D) Multiple 1.15 spacing
Computer Science & Information Technology