OurBigBook
About
$
Donate
Sign in
Sign up
Algorithm correctness
Ancestors will show here when the tree index is updated
2026-10-13
0
Like
NaN By others
on same topic
0 Discussions
Create my own version
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
.
Incoming links
(8)
Algorithm
Binary search tree
Computer science
Linked list
Loop invariant
Merge algorithm
Merge sort
Sorting algorithm
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(NaN)
There are currently no matching articles.
See all articles in the same topic
Create my own version