This wiki is incomplete.
The difference between partial correctness and total correctness is that a totally correct algorithm requires the algorithm to terminate, while a partially correct algorithm is one that doesn't have a terminating function but produces a correct result if halted.
Add explanation that you think will be helpful to other members.
Example Question 1
This is the answer to the question, with a detailed solution. If math is needed, it can be done inline: , or it can be in a centered display:
And our final answer is 10.