What is the difference between the complexity of an algorithm and the complexity of a problem?

Navigation
0

I would like to know the difference between the complexity of an algorithm and the complexity of a problem, ie what points differ between the two

    
asked by anonymous 24.06.2017 / 23:19

1 answer

0

The correct terminology is to say that a problem belongs to a class of temporal complexity.

To find out which class a problem belongs to, we should see which algorithm solves that problem (ie, the algorithm with the least temporal complexity):

  • If this algorithm has polynomial complexity, the problem belongs to class P;
  • If this algorithm has exponential complexity, the problem belongs to the EXPTIME class;
  • etc
05.11.2018 / 12:06
Change an array of char within a function Show only the last video of the php channel