0
What are your views about this unsolved programming problem?đđ
1. CORRECTNESS:- In theoretical computer science, correctness of an algorithm is asserted when it is said that the algorithm is correct with respect to a specification . Functional correctness refers to the input - output behaviour of the algorithm (i.e., for each input it produces the expected output). More info. available on Wikipedia.đ
1 Answer
+ 3
It doesn't seem unsolved but rather unsolvable to me