Any algorithm that solves a general computational problem is referred to as tractable.

Question

Quizplus · Accepted Answer

A problem is considered tractable if it can be solved in polynomial time, meaning the time to solve the problem grows at a polynomial rate as the size of the input increases. Not all algorithms that solve general computational problems do so in polynomial time; some may require exponential time, making them intractable for large inputs.

Any Algorithm That Solves a General Computational Problem Is Referred