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:
In Python:
low = int(input("Low: "))
high = int(input("High: "))
if low >= 1000000000 or high >=1000000000:
print("Out of range")
else:
mylist = []
for num in range(low,high+1):
flag = False
if num > 1:
for i in range(2, num):
if (num % i) == 0:
flag = True
break
if not flag:
mylist.append(num)
print(num, end = " ")
print()
print("The twin primes are: ",end="")
count = 0
for i in range(1,len(mylist)):
if mylist[i] - mylist[i-1] == 2:
print(str(mylist[i])+" & "+str(mylist[i-1]),end=", ")
count+=1
print()
print("There are "+str(count)+" twin primes")
Explanation:
See attachment for complete program where comments were used to explain each line
Answer:
Probably a sports game
Explanation:
A role-playing means acting it out, so you need to explain the life with a structured narrative.
An adventure game needs lots of background, so you need to fill that in with a structured narrative.
A sports game revolves solely around sports, so you only need to know how to play the game and/or sport, so no structured narrative is needed.
An fps game needs a structured narrative in that it is similar to an adventure game and needs background.
Let me know if I was right! Hope this helped. :)
