The process of checking the correctness of an algorithm, without actually running
the program is known as
Answers
Answered by
1
Answer:
Formal reasoning. The only way to prove the correctness of an algorithm over all possible inputs is by reasoning formally or mathematically about it. One form of reasoning is a "proof by induction", a technique that's also used by mathematicians to prove properties of numerical sequences.
Explanation:
PLEASE,MARK ME!
Answered by
0
Answer: Desk- checking
Explanation: No Explanation
Similar questions