Complexity Classes

Exploring the relationship between P, NP, and NP-Complete

Click "Next Step" to begin
NP
NP-Complete
P
Sorting $O(n \log n)$
Shortest Path $O(E \log V)$
3-SAT
TSP
P (Polynomial Time)
NP (Nondeterministic Polynomial)
NP-Complete