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:
Jog
Explanation:
The variable options is a list containing 5 string values
options = ["ski", "surf", "jog", "bike", "hike"]
Indexing in python starts from 0 ; hence the index values of the list values are :
0 - ski
1 - surf
2 - jog
3 - bike
4 - hike
The statement ;
print(options[2]) means print the string at index 2 in the list named options
The string at index 2 is jog ;
Hence, the string jog is printed.
To <span>rite a statement that terminates the current loop when the value of the int variables x. and y.are equal please check below:
</span>
if (x == y) break; // exit loop
I hope the answer will help you. Thank you.
The Boolean type is used to represent true or false values
Answer:
$20 per day for next 5 working days.
Explanation:
if 50% is $100.00 another $100 need to achieve in 5 days.
100/5=20
