I have an algorithm that runs in O(N2), 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) 10 minutes
c) 100 minutes
d) 1000 minutes
e) You haven’t given enough information. I can’t tell.


c) 100 minutes

```
new_time = old_time *(10002)/(1002)= 100 minutes.
```

Computer Science & Information Technology

You might also like to view...

Write the syntax for an ethereal display filter that show packets containing ICMP messages with a source or destination IP address equal to 10.0.1.12 and frame numbers between 15 and 30.

What will be an ideal response?

Computer Science & Information Technology

What are the three defined implementations of Fast Ethernet?

What will be an ideal response?

Computer Science & Information Technology

Write an If...Then...Else statement that displays the string "Balance Due" in thelblMessagecontrol when thedecBalancevariable contains a number that is greater than 0; otherwise, assign the string "Thank you for your payment."

What will be an ideal response?

Computer Science & Information Technology

The BinarySearch procedure returns ____ if the desired value is found in the array.

A. the element's value B. the matching index value C. 1 D. ?1

Computer Science & Information Technology