71.6k views
0 votes
What is the difference between tractable, intractable and unsolvable algorithms?

1 Answer

2 votes
Tractable refers to that how hard is problem
Tractable are those that can be solved in a polynomial time
where as the intractable are those which can be solved by using large time
whereas unsolvable are those which cannot be solved and requires infinite amount of time
hope it helps
User Bahbar
by
6.1k points
Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.