4.4.4.5 Classification of algorithmic problems

To meet this assessment objective you need to:

• Know that algorithms may be classified as being either: 

• tractable - problems that have a polynomial (or less) time solution are called tractable problems. 

• intractable - problems that have no polynomial (or less) time solution are called intractable problems.