Does the following algorithm have a polynomial or nonpolynomial time complexity? Explain your answer.
procedure mystery (ListOfNumbers)
Pick a collection of numbers from ListOfNumbers.
if (the numbers in that collection add to 125)
then (answer "yes")
else (do not give an answer)
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.