Model answer
A valid algorithm has specified input, specified output, definiteness (every step is unambiguous), finiteness (it terminates), and effectiveness (each step is executable in finite time). Correctness is then proved for every valid input.
Use the key terms, then explain the reasoning.