Which of the following best explains how algorithms that run on a computer can be used to solve problems?
a. All problems can be solved with an algorithm that runs in a reasonable amount of time.
b. All problems can be solved with an algorithm, but some algorithms might need a heuristic to run in a reasonable amount of time.
c. All problems can be solved with an algorithm, but some algorithms might run in an unreasonable amount of time.
d. Some problems cannot be solved by an algorithm.

Respuesta :

Lanuel

The statement which best explains how algorithms running on a computer can be used to solve problems is; D. Some problems cannot be solved by an algorithm.

What is an algorithm?

An algorithm is simply a standard formula or procedures which is made up of a set of finite steps and instructions that must be executed on a computer, so as to proffer solutions to a problem or solve a problem under appropriate conditions.

However, it should be noted that it is not all problems that can be solved by an algorithm, especially because the required parameters and appropriate conditions are not feasible or met.

Read more on algorithm here: brainly.com/question/24793921