An algorithm is complete if

    • It terminates with a solution when one exists
    • It starts with a solution
    • It does not terminate with a solution
    • It has a loop
...

It terminates with a solution when one exists


0 Answered this Question:

Unleash Your Voice, Share Your Thoughts: Join the Question-Answering Revolution