 Algorithm correctness

Partial correctness means that, if the algorithm terminates on a permitted input, its output meets the specification. Total correctness additionally requires termination on every permitted input.