Algorithm Correctness and Termination

Question 1

What is algorithm correctness?

Answer 1

Proof that an algorithm produces the expected output for all valid inputs.

Question 2

What is termination in algorithms?

Answer 2

A property ensuring an algorithm always reaches a stopping condition.

Question 3

What is an invariant in algorithms?

Answer 3

A property that remains true at each step of execution (used in loop invariants).

Question 4

How do you prove an algorithm is correct?

Answer 4

Using induction or loop invariants.