Introduction to complexity theory
Here I am introducing
Tractable/easy Problems: There is an efficient algorithm to solve it in polynomial time.
Intractable/hard Problems: There is no efficient algorithm to solve it in polynomial time.
Deterministic Algorithms: Result of every operation is uniquely defined. There is no choice.
Non Deterministic Algorithms: Result of every operation is not uniquely defined. There is choice for next step.
After watching this video learn about the complexity classes
• The Complexity classes
To know more join my Udemy course on Design and Analysis of Algorithm
https://www.udemy.com/course/algorith...