What is a step-by-step procedure for solving a problem, especially by a computer?

• A. Algorithm
• B. Formula
• C. Hypothesis
• D. Theorem

Answer: (A)

A step-by-step procedure for solving a problem, especially by a computer, is an algorithm. An algorithm is a precise sequence of instructions that, when given a particular input, produces a result. It must be well-defined, finite, and unambiguous so a computer can execute it exactly the same way each time. In practice, algorithms spell out what to do and in what order, and they can be written in plain language, pseudocode, flowcharts, or actual code. This concept differs from a formula, which is a compact expression of a relationship between quantities without describing a sequence of actions; a hypothesis, which is a tentative explanation to be tested; and a theorem, which is a statement proven from axioms and earlier results. For example, an algorithm to find the larger of two numbers involves comparing them and returning the bigger one, a clear, repeatable step-by-step process.