Answer:
The answer is D
Explanation:
file association associates a file with an application capable of opening that file. More commonly, a file association associates a class of files with a corresponding application.
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).
Nolur acil lütfen yalvarırım yalvarırım lütfen yalvarırım when should you integrate technology?
