Design and Analysis of Algorithms20785 marksComplexity Classes
Explain in brief about the complexity classes P, NP and NP Complete.
Explain in brief about the complexity classes P, NP and NP Complete. [5]
Definition: P is the class of decision problems that can be solved by a deterministic algorithm in polynomial time, i.e., in O(n^k) steps for some non-negative integer k, where n is the size of the input. - These problems are considered "fast" or efficiently solvable. - Examples: Sorting, Searchi...