Answer:
O(N!), O(2N), O(N2), O(N), O(logN)
Explanation:
N! grows faster than any exponential functions, leave alone polynomials and logarithm. so O( N! ) would be slowest.
2^N would be bigger than N². Any exponential functions are slower than polynomial. So O( 2^N ) is next slowest.
Rest of them should be easier.
N² is slower than N and N is slower than logN as you can check in a graphing calculator.
NOTE: It is just nitpick but big-Oh is not necessary about speed / running time ( many programmers treat it like that anyway ) but rather how the time taken for an algorithm increase as the size of the input increases. Subtle difference.
Answer:
public class Main
{
public static void main(String[] args) {
int carYear = 1995;
if(carYear < 1967)
System.out.println("Probably has few safety features.");
if(carYear > 1971)
System.out.println("Probably has head rests.");
if(carYear > 1992)
System.out.println("Probably has anti-lock brakes.");
if(carYear > 2002)
System.out.println("Probably has tire-pressure monitor.");
}
}
Explanation:
The code is in Java.
Initialize the carYear
Use if statements to handle year before 1967, after 1971, after 1992 and after 2002.
Print the required message for each if statement
<span>Dragging or sizing affects only a "Selected Object." For example, an image, you need to click the image in order for you to select that image. The image is considered as an object. From the time you click on the picture, there are points visible where you can click and drag upon it nor resize.</span>
I believe the answer is C.
In preparing a works cited list, you should mlways follow MLA style. MLA style is the proper way to cite references<span> </span>
