Algorithm reductions

If I have a algorithm A that i have proven belongs to P can this algorit开发者_如何学Pythonhm also belong to the NPC class or is it strictly P? What about NP? P Belongs to NP right?

Thx for any help!

/Marthin

If P!= NP then P is not a subset of NPC, in fact they don't intersect. If P=NP, then P and NPC are the same. All P algorithms are part of NP though. Check the Wikipedia page for more information, and a diagram that explains exactly what you're asking.

If you can prove that P=NP, you will be very famous.