Because it is a very fun game and if it is fun people like it
Answer:
(a) What is the best case time complexity of the algorithm (assuming n > 1)?
Answer: O(1)
(b) What is the worst case time complexity of the algorithm?
Answer: O(n^4)
Explanation:
(a) In the best case, the if condition will be true, the program will only run once and return so complexity of the algorithm is O(1)
.
(b) In the worst case, the program will run n^4 times so complexity of the algorithm is O(n^4).
The answer is a lol i just looked it up
Answer:
D- Trojan Horse
Explanation:
Trojan horse is a malware that has hidden code and look legitimate in order to damage or transfer harmful action on the computer.
Example hackers can disguise as Trojan horse by spying on the victims computer in order to gain access to sensitive data on the computer over the network.
Answer:
I think that the answer is A
