You need just a single instance of algorithm's input for which the algorithm fails in order to show that the algorithm is incorrecthttps://go-math-science.com/computing/algorithms/introduction/problem-solving/you-need-just-a-single-instance-of-algorithms-input-for-which-the-algorithm-fails-in-order-to-show-that-the-algorithm-is-incorrecthttps://go-math-science.com/@@site-logo/logo-new.png
volume_mute
You need just a single instance of algorithm's input for which the algorithm fails in order to show that the algorithm is incorrect
publish date: 2022/06/09 13:49:00 GMT+10
volume_mute
Correct Answer
True
Explanation
No need of more than a single legitimate input in order to prove the correctness of the algorithm.
Reference
Introduction to the Design and Analysis of Algorithms, 3rd edition
