Answer:
The correct answer for the given question is "Machine languages can be used to write programs that can run on any machine."
Explanation:
The machine language consist of binary digit i. e 0 and 1 .Computer can understand only the machine language .The machine language consist of code that is written in bits so it is used to express algorithms.When any program is compiled the compiler are converted into machine code so the machine language is produced by the compiler .
Machine language cannot used to write a program that run on any machine.
Wrong, You should get renters insurance to insure your items that you do have or will recieve in the future are safe
It stands for Electronic Business, a typical example of this is a online store.
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).
